Computer Science – Information Theory
Scientific paper
2009-09-17
J. Pujol, J. Rifa and L. Ronquillo. Construction of Additive Reed-Muller Codes. Applied Algebra, Algebraic Algorithms and Erro
Computer Science
Information Theory
7 pages, Part of the material in this paper was presented without proofs at the 18-th Symposium on Applied algebra, Algebraic
Scientific paper
10.1007/978-3-642-02181-7
The well known Plotkin construction is, in the current paper, generalized and used to yield new families of Z2Z4-additive codes, whose length, dimension as well as minimum distance are studied. These new constructions enable us to obtain families of Z2Z4-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.
Pujol Jaume
Rifá Josep
Ronquillo L.
No associations
LandOfFree
Construction of Additive Reed-Muller Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Construction of Additive Reed-Muller Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Construction of Additive Reed-Muller Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-390740