Journal Article

DECODER COMPLEXITY FOR BCH CODES.

Proceedings of the Institution of Electrical Engineers (1973) 120(4) 429-431
DOI: 10.1049/piee.1973.0093
20Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The logic complexity and computational complexity of decoders for BCH codes are investigated, and bounds on complexity are obtained. These are compared with earlier results of J. E. Savage for arbitrary block codes and for some special decoding rules. It is found that decoders for the class of BCH codes are of much lower complexity.

Cite

CITATION STYLE

APA

Bajoga, B. G., & Walbesser, W. J. (1973). DECODER COMPLEXITY FOR BCH CODES. Proceedings of the Institution of Electrical Engineers, 120(4), 429–431. https://doi.org/10.1049/piee.1973.0093

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free