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

Roger W. Ehrich; Sik-Sang Yau

doi:10.1109/TIT.1969.1054259

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

Roger W. Ehrich, Sik-Sang Yau

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

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 language	English (US)
Pages (from-to)	113-117
Number of pages	5
Journal	IEEE Transactions on Information Theory
Volume	15
Issue number	1
DOIs	https://doi.org/10.1109/TIT.1969.1054259
State	Published - 1969
Externally published	Yes

ASJC Scopus subject areas

Computer Science Applications
Information Systems
Library and Information Sciences

Access to Document

10.1109/TIT.1969.1054259

Cite this

@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 = "IRE Professional Group 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

SN - 0018-9448

VL - 15

SP - 113

EP - 117

JO - IRE Professional Group on Information Theory

JF - IRE Professional Group on Information Theory

IS - 1

ER -

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

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this