Error-Locating Pairs for Cyclic Codes

Iwan M. Duursma, Ralf Kötter

Research output: Contribution to journalArticlepeer-review


A general decoding method for linear codes is investigated for cyclic codes. The decoding consists of solving two systems of linear equations. All but four binary cyclic codes of length less than 63 can so be decoded up to their actual distance. A new family of codes is given for which the decoding needs only O(n2) operations.

Original languageEnglish (US)
Pages (from-to)1108-1121
Number of pages14
JournalIEEE Transactions on Information Theory
Issue number4
StatePublished - Jul 1994
Externally publishedYes


  • Algebraic decoding
  • MDS code
  • QR code
  • cyclic code
  • error-locating pair

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'Error-Locating Pairs for Cyclic Codes'. Together they form a unique fingerprint.

Cite this