Open AccessArticle
Asymptotically optimal binary codes of polynomial complexity correcting localized errors
Rudolf Ahlswede,L. A. Bassalygo,M.S. Pinsker-1995-01-01-PUB – Publications at Bielefeld University (Bielefeld University)
2PDF
TL;DRAbstract
The asymptotically optimal transmission rate of binary codes correcting localized errors is known when the number of errors grows linearly in the code length. Here we prove that this rate can be attained by codes with polynomial complexity of encoding, decoding, and code construction.
Chat with Paper
AI Agents for this Paper
The asymptotically optimal transmission rate of binary codes correcting localized errors is known when the number of errors grows linearly in the code length. Here we prove that this rate can be attained by codes with polynomial complexity of encoding, decoding, and code construction.
Keywords
Decoding methodsMathematicsBinary numberCode (set theory)Linear codeDiscrete mathematicsPolynomialEncoding (memory)
Chat
Click to start Chat