We present a simple and efficient error correction scheme for array-like data structures. We assume that the channel behaves such that each row of a received array is either error-free or corrupted by many symbol errors. Provided that row error vectors are linearly independent, the proposed decoding algorithm can correct asymptotically one erroneous row per redundant row, even without having reliability information from the channel output. This efficient decoding algorithm can be used for correction of error clusters and for decoding of concatenated codes. We also derive a random access scheme that has many similarities with the Aloha system.