Abstract
Our purpose is to recall some basic aspects about linear and cyclic codes. We first briefly describe the role of error-correcting codes in communication. To do this we introduce, with examples, the concept of linear codes and their parameters, in particular the Hamming distance.
A fundamental subclass of linear codes is given by cyclic codes, that enjoy a very interesting algebraic structure. In fact, cyclic codes can be viewed as ideals in a residue classes ring of univariate polynomials. BCH codes are the most studied family of cyclic codes, for which some efficient decoding algorithms are known, as the method of Sugiyama.
This is a preview of subscription content, log in via an institution to check access.
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
A. M. Barg, E. Krouk, and H. C. A. van Tilborg, On the complexity of minimum distance decoding of long linear codes, IEEE Trans. on Inf. Th. 45 (1999), no. 5, 1392–1405.
L. M. Bazzi and S. K. Mitter, Some randomized code constructions from group actions, IEEE Trans. on Inf. Th. 52 (2006), 3210–3219.
E. R. Berlekamp, Algebraic coding theory, McGraw–Hill, New York, 1968.
E. R. Berlekamp, Algebraic coding theory (revised edition), Aegean Park, Walnut Creek, 1984.
E. R. Berlekamp, R. J. McEliece, and H. C. A. van Tilborg, On the inherent intractability of certain coding problems, IEEE Trans. on Inf. Th. 24 (1978), no. 3, 384–386.
S. D. Berman, Semisimple cyclic and Abelian codes. II, Cybernetics 3 (1967), no. 3, 17–23.
R. E. Blahut, Theory and practice of error control codes, Addison–Wesley, Reading, 1983.
R. C. Bose and D. K. Ray-Chaudhuri, On a class of error correcting binary group codes, Information and Control 3 (1960), 68–79.
P. Camion, A proof of some properties of Reed–Muller codes by means of the normal basis theorem, Combinatorial mathematics and its application, Univ. of North Carolina, Chapel Hill, 1969, pp. 371–376.
G. Castagnoli, On the asymptotic badness of cyclic codes with block-lengths composed from a fixed set of prime factors, LNCS, vol. 357, Springer, Berlin, 1989, pp. 164–168.
G. Castagnoli, J. L. Massey, P. A. Schoeller, and N. von Seeman, On repeated-root cyclic codes, IEEE Trans. on Inf. Th. 37 (1991), 337–342.
R. T. Chien, Cyclic decoding procedure for the Bose–Chaudhuri–Hocquenghem codes, IEEE Trans. on Inf. Th. 10 (1964), 357–363.
G. D. Forney, On decoding BCH codes, IEEE Trans. on Inf. Th. 11 (1965), 549–557.
E. Guerrini and A. Rimoldi, FGLM-like decoding: from Fitzpatrick’s approach to recent developments, this volume, 2009, pp. 197–218.
R. W. Hamming, Error detecting and error correcting codes, Bell Systems Technical Journal 29 (1950), 147–160.
D. G. Hoffman, Coding theory: The essential, Dekker, New York, 1991.
J. Justensen, A class of constructive asymptotically good algebraic codes, IEEE Trans. on Inf. Th. 18 (1972), no. 5, 652–656.
T. Kasami, A Gilbert-Varshamov bound for quasi-cyclic codes of rate 1/2, IEEE Trans. on Inf. Th. 20 (1974), 679–679.
S. Lin, An introduction to error-correcting codes, Prentice Hall, New York, 1970.
S. Lin and E. J. Weldon, Long BCH codes are bad, Information Control 11 (1967), 445–451.
F. J. MacWilliams and N. J. A. Sloane, The theory of error-correcting codes. I and II, North-Holland, Amsterdam, 1977.
C. Martinez-Perez and W. Willems, Is the class of cyclic codes asymptotically good? IEEE Trans. on Inf. Th. 52 (2006), no. 2, 696–700.
J. L. Massey, Shift-register synthesis and BCH decoding, IEEE Trans. on Inf. Th. 15 (1969), 122–127.
T. Mora and E. Orsini, Decoding cyclic codes: the Cooper philosophy, this volume, 2009, pp. 69–91.
W. W. Peterson and E. J. Weldon Jr., Error-correcting codes, second ed., MIT Press, Cambridge, 1972.
V. Pless, Introduction to the theory of error-correcting codes, Wiley, New York, 1982.
V. S. Pless, W. C. Huffman, and R. A. Brualdi (eds.), Handbook of coding theory, vols. I, II, North-Holland, Amsterdam, 1998.
I. S. Reed and G. Solomon, Polynomial codes over certain finite fields, J. Soc. Indust. Appl. Math. 8 (1960), 300–304.
C. E. Shannon, A mathematical theory of communication, Bell System Tech. J. 27 (1948), 379–423, 623–656.
Y. Sugiyama, S. Kasahara, S. Hirasawa, and T. Namekawa, A method for solving key equation for decoding Goppa codes, Inform. Contr. 27 (1975), 87–99.
J. H. van Lint, Introduction to coding theory, third ed., Graduate Texts in Mathematics, vol. 86, Springer, Berlin, 1999.
A. Vardy, Algorithmic complexity in coding theory and the minimum distance problem, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, 1997, pp. 92–109.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Augot, D., Betti, E., Orsini, E. (2009). An Introduction to Linear and Cyclic Codes. In: Sala, M., Sakata, S., Mora, T., Traverso, C., Perret, L. (eds) Gröbner Bases, Coding, and Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-93806-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-93806-4_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-93805-7
Online ISBN: 978-3-540-93806-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)