Redundant residue polynomial codes

D. C. Bossen, S. S. Yau

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


In this paper, a new class of error-correcting linear block codes using symbols from GF(2m) is presented. These codes are not cyclic codes, but posses instead a unique algebraic structure. It is shown that they are instantaneously decodable with a modest amount of hardware consisting almost entirely of mod 2 adders for correcting burst errors. Furthermore, their efficiency compares favorably with the Varsharmov-Gilbert bound for both random errors over GF(2m) and burst errors over GF(2).

Original languageEnglish (US)
Pages (from-to)597-618
Number of pages22
JournalInformation and Control
Issue number6
StatePublished - Dec 1968
Externally publishedYes

ASJC Scopus subject areas

  • Engineering(all)


Dive into the research topics of 'Redundant residue polynomial codes'. Together they form a unique fingerprint.

Cite this