An introduction to linear and cyclic codes

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.
Complete list of metadatas

Cited literature [32 references]  Display  Hide  Download

https://hal.inria.fr/inria-00550061
Contributor : Daniel Augot <>
Submitted on : Thursday, December 23, 2010 - 1:21:03 PM
Last modification on : Wednesday, August 21, 2019 - 9:02:02 PM
Long-term archiving on: Thursday, March 24, 2011 - 2:49:25 AM

File

introcyclic-springer.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Daniel Augot, Emmanuela Orsini, Emanuele Betti. An introduction to linear and cyclic codes. Sala, Massimiliano and Mora, Teo and Perret, Ludovic and Sakata, Shojiro and Traverso, Carlo. Gröbner Bases, Coding, and Cryptography, Springer-Verlag, pp.47-68, 2009, Gröbner Bases, Coding, and Cryptography, ⟨10.1007/978-3-540-93806-4_4⟩. ⟨inria-00550061⟩

Share

Metrics

Record views

334

Files downloads

1033