On the Problem of Finding Zero-Concurring Codewords

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.