Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

By Marc P. C. Fossorier, Hideki Imai, Shu Lin, A. Poli. Lecture Notes in Computer Science, 2009

321 citations recorded by the source corpus.

The well known Plotkin construction is, in the current paper, generalized and used to yield new families of Z2 Z4 -additive codes, whose length, dimension as well as minimum distance are studied. These new constructions enable us to obtain families of Z2 Z4 -additive codes such that, under the Gray map, the corresponding binary codes have the same parameters and properties as the usual binary linear Reed-Muller codes. Moreover, the first family is the usual binary linear Reed-Muller family.

View Paper: https://www.semanticscholar.org/paper/208bb3bb658384b6a17c38917c83d6eba989859b