Centered codes

MaRDI QIDQ761418zbMATH OpenFDO

Authors Kamil S. Zigangirov, V. D. Kolesnik

Publication date 1984

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

block codescomplexity of decoding

Mathematics Subject Classification ID

Decoding (94B35) Error probability in coding theory (94B70)

Review text

The authors propose a method of constructing and decoding block codes that makes it possible to reduce the complexity of decoding without significantly increasing the error probability. It is shown that in the case of a BSC with strong noise, at transmission rates close to the channel capacity, there exist centered codes for which the exponent of the error probability is equal to the exponent of random coding, while the number of computational operations involved in decoding is proportional to mn exp\({}_ 2(nR/m)\), where n and R are the code length and rate, respectively; m is an arbitrary integer that is bounded from above by a quantity that depends on the difference C-R (C is the channel capacity), that increases as this difference decreases.

Recommendations

• Centered error-correcting codes
• Certain generalizations of concatenated codes--Exponential error bounds and decoding complexity
• Decoding of Expander Codes at Rates Close to Capacity
• A recursive approach to low complexity codes
• Algebraic Codes Achieving the Capacity of the Binary Symmetric Channel

Cited in

(1)

• Centered error-correcting codes

This page was built for publication: Centered codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761418)