Decoding Cyclic Codes: the Cooper Philosophy

Teo Mora () and Emmanuela Orsini ()
Additional contact information
Teo Mora: University of Genova, DISI
Emmanuela Orsini: University of Pisa, Department of Mathematics

A chapter in Gröbner Bases, Coding, and Cryptography, 2009, pp 69-91 from Springer

Abstract: Abstract In 1990 Cooper suggested to use Gröbner basis computations in order to deduce error locator polynomials of cyclic codes. The aim of this tutorial is to show, with illuminating examples, how Cooper’s approach has been refined up to give both an online decoder and general error locator polynomials.

Keywords: Linear Code; Cyclic Code; Decode Algorithm; Syndrome Variety; Receive Word (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-93806-4_5

Ordering information: This item can be ordered from
http://www.springer.com/9783540938064

DOI: 10.1007/978-3-540-93806-4_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().