On the Problem of Finding Zero-Concurring Codewords

Alexander Vardy, Yair Beery

Research output: Contribution to journalArticlepeer-review


Zero-concurring codewords disclose a certain structure of the code that may be employed for efficient soft-decision decoding and for designing dc-free codes. New methods for constructing sets of zero-concurring codewords are presented for several families of codes. For the general case an algorithmic solution of the problem is offered. A table of results obtained using the proposed techniques is supplied for all the primitive narrow-sense binary BCH codes of length up to 127.

Original languageEnglish
Pages (from-to)180-187
Number of pages8
JournalIEEE Transactions on Information Theory
Issue number1
StatePublished - Jan 1991


Dive into the research topics of 'On the Problem of Finding Zero-Concurring Codewords'. Together they form a unique fingerprint.

Cite this