Optimal symbol-by-symbol decoding of binary block codes

Authors
Nazarov, LE Smol'yaninov, VM
Citation
Le. Nazarov et Vm. Smol'Yaninov, Optimal symbol-by-symbol decoding of binary block codes, J COMMUN T, 44(5), 1999, pp. 518-522
Citations number
9
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
JOURNAL OF COMMUNICATIONS TECHNOLOGY AND ELECTRONICS
ISSN journal
10642269 → ACNP
Volume
44
Issue
5
Year of publication
1999
Pages
518 - 522
Database
ISI
SICI code
1064-2269(199905)44:5<518:OSDOBB>2.0.ZU;2-S
Abstract
A procedure of optimal symbol-by-symbol decoding of binary block codes char acterized by the property of direct sum for dual codes is proposed. It is s hown that this procedure requires less arithmetic operations and memory vol ume as compared with known procedures of symbol-by-symbol decoding. The pro cedure can be applied to decoding a wide family of binary block codes (cycl ic codes, product-codes, and squaring construction codes).