Abstract
We have done some numerical experiments to find large coset leaders for the first order Reed-Muller codes RM(m) of length 2m for odd m,m ≥ 9, by using some matrix groups acting on the field GF(2m) viewed as a GF(2)-vector space. The coset leaders so obtained are characteristic functions of subsets of GF(2m) that are union of orbits under the considered group and often have interesting combinatorial properties generalizing difference sets.
Preview
Unable to display preview. Download preview PDF.
References
Rothaus, O., On Bent Functions, J. Combinatorial Theory, Ser. A, vol. 20, 300–305, 1976.
Helleseth T., Klove T. and Mykkeltveit J., On the covering radius of binary codes, IEEE Trans. Inform. Theory, vol IT-24, 627–628, sept. 1978.
Berlekamp E.R. and Welch L.R., Weight distributions of the coset of the (32,6) Reed-Muller code, IEEE Trans. Inform. Theory, vol. IT-18, 203–207, jan. 1972.
Mykkeltveit J., The covering radius of the (128,8) Reed-Muller code is 56, IEEE Trans. Inform. Theory, vol IT-26, 359–362, May 1980.
Patterson N.J. and Wiedemann D.H., The covering radius of the (215, 16) Reed-Muller code is at least 16276, IEEE Trans. Inform. Theory, vol. IT-29, 354–356, 1983.
Courteau B. and Wolfmann J., On triple-sum-sets and two or three weights codes, Discrete Math. 50 (1984) 179–191.
Dillon J.F., Elementary Hadamard difference sets, Ph. D, Thesis, Maryland University, 1974.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Constantin, J., Courteau, B., Wolfmann, J. (1986). Numerical experiments related to the covering radius of some first order Reed-Muller codes. In: Calmet, J. (eds) Algebraic Algorithms and Error-Correcting Codes. AAECC 1985. Lecture Notes in Computer Science, vol 229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16776-5_710
Download citation
DOI: https://doi.org/10.1007/3-540-16776-5_710
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16776-1
Online ISBN: 978-3-540-39855-4
eBook Packages: Springer Book Archive