Redundant residue polynomial codes

D. C. Bossen, Sik-Sang Yau

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

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
Volume13
Issue number6
StatePublished - Dec 1968
Externally publishedYes

Fingerprint

Polynomials
Burst
Polynomial
Cyclic Codes
Random errors
Block Codes
Random Error
Block codes
Adders
Linear Codes
Algebraic Structure
Hardware
Class

Cite this

Redundant residue polynomial codes. / Bossen, D. C.; Yau, Sik-Sang.

In: Information and control, Vol. 13, No. 6, 12.1968, p. 597-618.

Research output: Contribution to journalArticle

Bossen, DC & Yau, S-S 1968, 'Redundant residue polynomial codes', Information and control, vol. 13, no. 6, pp. 597-618.
Bossen, D. C. ; Yau, Sik-Sang. / Redundant residue polynomial codes. In: Information and control. 1968 ; Vol. 13, No. 6. pp. 597-618.
@article{9daf7dc6b0d345c5b5c882104ca05977,
title = "Redundant residue polynomial codes",
abstract = "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).",
author = "Bossen, {D. C.} and Sik-Sang Yau",
year = "1968",
month = "12",
language = "English (US)",
volume = "13",
pages = "597--618",
journal = "Information and Computation",
issn = "0890-5401",
publisher = "Elsevier Inc.",
number = "6",

}

TY - JOUR

T1 - Redundant residue polynomial codes

AU - Bossen, D. C.

AU - Yau, Sik-Sang

PY - 1968/12

Y1 - 1968/12

N2 - 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).

AB - 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).

UR - http://www.scopus.com/inward/record.url?scp=33947189263&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33947189263&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:33947189263

VL - 13

SP - 597

EP - 618

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

IS - 6

ER -