A Class of High-Speed Decoders for Linear Cyclic Binary Codes

Roger W. Ehrich, Sik-Sang Yau

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

A general method is proposed for decoding any cyclic binary code at extremely high speed using only modulo 2 adders and threshold elements, and the decoders may be designed for maximum-likelihood decoding. The number of decoding cycles is a fraction of the number of digits in the code word.

Original languageEnglish (US)
Pages (from-to)113-117
Number of pages5
JournalIEEE Transactions on Information Theory
Volume15
Issue number1
DOIs
StatePublished - 1969
Externally publishedYes

Fingerprint

Binary codes
Decoding
Threshold elements
Adders
Maximum likelihood

ASJC Scopus subject areas

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

Cite this

A Class of High-Speed Decoders for Linear Cyclic Binary Codes. / Ehrich, Roger W.; Yau, Sik-Sang.

In: IEEE Transactions on Information Theory, Vol. 15, No. 1, 1969, p. 113-117.

Research output: Contribution to journalArticle

@article{be492c048b7245808debfd6a4b9c57da,
title = "A Class of High-Speed Decoders for Linear Cyclic Binary Codes",
abstract = "A general method is proposed for decoding any cyclic binary code at extremely high speed using only modulo 2 adders and threshold elements, and the decoders may be designed for maximum-likelihood decoding. The number of decoding cycles is a fraction of the number of digits in the code word.",
author = "Ehrich, {Roger W.} and Sik-Sang Yau",
year = "1969",
doi = "10.1109/TIT.1969.1054259",
language = "English (US)",
volume = "15",
pages = "113--117",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - A Class of High-Speed Decoders for Linear Cyclic Binary Codes

AU - Ehrich, Roger W.

AU - Yau, Sik-Sang

PY - 1969

Y1 - 1969

N2 - A general method is proposed for decoding any cyclic binary code at extremely high speed using only modulo 2 adders and threshold elements, and the decoders may be designed for maximum-likelihood decoding. The number of decoding cycles is a fraction of the number of digits in the code word.

AB - A general method is proposed for decoding any cyclic binary code at extremely high speed using only modulo 2 adders and threshold elements, and the decoders may be designed for maximum-likelihood decoding. The number of decoding cycles is a fraction of the number of digits in the code word.

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

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

U2 - 10.1109/TIT.1969.1054259

DO - 10.1109/TIT.1969.1054259

M3 - Article

AN - SCOPUS:84937739924

VL - 15

SP - 113

EP - 117

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 1

ER -