Abstract
This paper gives a method of construction for binary cyclic codes of even length out of shorter ones of odd length. This construction enables us to establish the set of the minimal distances reached by even length codes, and for each of these distances, to determine the associated generator polynomial of lowest degree. Thanks to this result we construct the complete table of the best possible binary cyclic codes on each minimal distance up to the length 64, finishing off in that way the table of the binary cyclic codes of odd length compiled by CHEN and lying in [5]. It can be noticed that VAN LINT found similar results but for only few specific values, see [3].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F.J. Macwilliams and N.J.A. Sloane, The theory of error-correcting codes, Amsterdam, North-Holland, 1977.
G. Castagnoli, J.L. Massey, P.A. Schoeller and N. Von Seemann, “On repeated-root cyclic codes”, IEEE Trans. Inform. Theory, vol. 37, no. 2, pp. 337–342, Mar.1991.
J.H. Van Lint, “Repeated-root cyclic codes”, IEEE Trans. Inform. Theory, vol. 37, no. 2, pp. 343–345, Mar.1991.
H. Hasse, “Theorie der höheren Differentiale in einem algebraischen Funktionenkörper mit vollkommenem Konstantenkörper hei beliebiger Charakteristik”, J. Reine. Ang. Math., vol. 175, pp. 50–54, 1936.
W.W. Peterson and E.J. Weldon, Jr, Error-Correcting Codes, Second ed. Cambridge, MA: MIT Press, 1972.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Wien
About this chapter
Cite this chapter
Martin, JP. (1993). Construction of the Best Binary Cyclic Codes of Even Length. In: Camion, P., Charpin, P., Harari, S. (eds) Eurocode ’92. International Centre for Mechanical Sciences, vol 339. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2786-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-7091-2786-5_6
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82519-8
Online ISBN: 978-3-7091-2786-5
eBook Packages: Springer Book Archive