Euclidean geometry codes, minimum weight words and decodable error-patterns using bit-flipping

We determine the number of minimum weight codewords in a class of Euclidean geometry codes and link the performance of bit-flipping decoding to the geometry of the error patterns