Abstract
In this paper we review some of the properties of constacyclic codes and their q-ary images. It is demonstrated that some of these both have a very simple encoder and can be decoded using standard equipment. Next we find all constacyclic codes whose q-ary images are by a Tschirnhaus transformation isomorphic to shortened cyclic codes. It turns out that this very large class also includes some cyclic codes. As an example the binary image of all cyclic MDS codes of length 2m+1 are isomorphic to shortened cyclic codes.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Hanan and F. P. Palermo, “On cyclic codes for multi-phase data transmission system,” J. Soc. Indust. Appl. Math., vol. 12, no. 4, pp. 794–804, Dec. 1964.
F. J. MacWilliams, “On binary cyclic codes which are also cyclic codes over GF(2S),” SIAM J. Appl. Math., vol. 19, no. 1, pp. 75–95, July 1970.
P. Rabizzoni, “Démultipliés de codes sur une extension de \(\mathbb{F}_q\),” Thèse de Doctorat de 3-ième cycle, Université de Provence, France, 1983.
C. Mouaha, “Codes linéares sur un corps fini déduits de codes sur une extension,” Thèse de Doctorate de 3-ième cycle, Faculté des Sciences de Luminy, Luminy, France, 1988.
D. A. Leonard, “Linear cyclic codes of wordlength v over GF(q s) which are also linear cyclic codes of wordlength sv over GF(q),” Designs, Codes Cryptogr., vol. 1, no. 2, pp. 183–189, 1991.
G. Séguin, “A counter-example to a recent result on the q-ary image of a q s-ary cyclic code,” Designs, Codes Cryptogr., vol. 4, no. 2, pp. 171–175, 1994.
G. E. Séguin, “The q-ary Image of a q m-ary Cyclic Code,” IEEE Trans. Inform. Theory, vol. 41, pp. 387–399, March 1995.
E. R. Berlekamp, Algebraic Coding Theory. Laguna Hills, CA: Aegean Park Press, 1984.
A. Krishna and D. V. Sarwate, “Pseudocyclic maximum-distance-seperable codes,” IEEE Trans. Inform. Theory, vol. 36, pp. 880–884. July 1990.
J. M. Jensen, “A Class of Constacyclic Codes,” IEEE Trans. Inform. Theory, vol. 40, pp. 951–954, May 1994.
J. M. Jensen, “Cyclic concatenated codes with constacyclic outer codes,” IEEE Trans. Inform. Theory, vol. 38, pp. 950–959, May 1992.
J. P. Pedersea and C. Dahl, “Classification of pseudo-cyclic MDS codes,” IEEE Trans. Inform. Theory, vol. 37, pp. 365–370, March 1991.
J. M. Jensen, “On Decoding Doubly Extended Reed-Solomon Codes,” in Proc. IEEE Int. Symp. Inform. Theory, p. 280, (Canada,) Sept. 17–22, 1995.
L. Rédei, Algebra, vol. 1. New York: Pergamon Press, 1967.
J. M. Jensen, manuscript in preparation.
W. W. Peterson and E. J. Weldon, Jr., Error-Correcting Codes, 2nd ed., Cambridge, BA: MIT Press, 1972.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jensen, J.M. (1997). On the q-ary image of cyclic codes. In: Mora, T., Mattson, H. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1997. Lecture Notes in Computer Science, vol 1255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63163-1_15
Download citation
DOI: https://doi.org/10.1007/3-540-63163-1_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63163-7
Online ISBN: 978-3-540-69193-8
eBook Packages: Springer Book Archive