Maximum-likelihood soft decision decoding of BCH codes

Alexander Vardy, Yair Be'ery

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The problem of efficient maximum-likelihood soft decision decoding of binary BCH codes is considered. It is known that those primitive BCH codes whose designed distance is one less than a power of two, contain subcodes of high dimension which consist of a direct sum of several identical codes. We show that the same kind of direct-sum structure exists in all the primitive BCH codes, as well as in the BCH codes of composite block length. We also introduce a related structure termed the 'concurring-sum', and then establish its existence in the primitive binary BCH codes. Both structures are employed to upper bound the number of states in the proper minimal trellis of BCH codes, and develop efficient algorithms for maximum-likelihood soft decision decoding of these codes.

Original languageEnglish
Title of host publicationProceedings of the 1993 IEEE International Symposium on Information Theory
PublisherPubl by IEEE
Pages29
Number of pages1
ISBN (Print)0780308786
StatePublished - 1993
Externally publishedYes
EventProceedings of the 1993 IEEE International Symposium on Information Theory - San Antonio, TX, USA
Duration: 17 Jan 199322 Jan 1993

Publication series

NameProceedings of the 1993 IEEE International Symposium on Information Theory

Conference

ConferenceProceedings of the 1993 IEEE International Symposium on Information Theory
CitySan Antonio, TX, USA
Period17/01/9322/01/93

Fingerprint

Dive into the research topics of 'Maximum-likelihood soft decision decoding of BCH codes'. Together they form a unique fingerprint.

Cite this