Bibliographic Metadata
Bibliographic Metadata
- TitleAsymptotically optimal binary codes of polynomial complexity correcting localized errors
- Author
- Is part ofProbl. Peredachi Inf., Vol. 31 Issue 2, page 76-83
- Published
- LanguageEnglish
- Document typeJournal Article
- Keywords
- URN
Restriction-Information
- The document is publicly available on the WWW
Links
- Social MediaShare
- ReferenceNo Reference available
- IIIF
Files
Classification
Abstract
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.
Stats
- The PDF-Document has been downloaded 11 times.