Error-locating pairs for cyclic codes

I.M. Duursma, R. Kötter

Research output: Contribution to journalArticleAcademicpeer-review

36 Citations (Scopus)
1 Downloads (Pure)

Abstract

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
Pages (from-to)1108-1121
JournalIEEE Transactions on Information Theory
Volume40
Issue number4
DOIs
Publication statusPublished - 1994

Fingerprint

Dive into the research topics of 'Error-locating pairs for cyclic codes'. Together they form a unique fingerprint.

Cite this