TY  - JOUR
AB  - 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.
DA  - 1995
KW  - Codierungstheorie
LA  - eng
IS  - 2
M2  - 76
PY  - 1995
SP  - 76-83
T2  - Probl. Peredachi Inf.
TI  - Asymptotically optimal binary codes of polynomial complexity correcting localized errors
UR  - https://nbn-resolving.org/urn:nbn:de:0070-bipr-21455
Y2  - 2024-11-21T23:41:12
ER  -