Title :
Multifold Euclidean geometry codes
fDate :
7/1/1973 12:00:00 AM
Abstract :
This paper presents a class of majority-logic decodable codes whose structure is based on the structural properties of Euclidean geometries (EG) and codes that are invariant under the affine group of permutations. This new class of codes contains the ordinary EG codes and some generalized EG codes as subclasses. One subclass of new codes is particularly interesting: they are the most efficient majority-logic decodable codes that have been constructed.
Keywords :
Geometry codes; Majority logic decoding; Concrete; Decoding; Galois fields; Geometry; Parity check codes; Sufficient conditions;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1973.1055019
