Asymptotically optimal binary codes of polynomial complexity correcting localized errors
Ahlswede R, Bassalygo LA, Pinsker MS (1995)
Probl. Peredachi Inf. 31(2): 76-83.
Zeitschriftenaufsatz
| Veröffentlicht | Englisch
Download
Autor*in
Ahlswede, RudolfUniBi;
Bassalygo, L. A.;
Pinsker, M. S.
Einrichtung
Abstract / Bemerkung
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.
Stichworte
Codierungstheorie
Erscheinungsjahr
1995
Zeitschriftentitel
Probl. Peredachi Inf.
Band
31
Ausgabe
2
Seite(n)
76-83
Page URI
https://pub.uni-bielefeld.de/record/1780563
Zitieren
Ahlswede R, Bassalygo LA, Pinsker MS. Asymptotically optimal binary codes of polynomial complexity correcting localized errors. Probl. Peredachi Inf. 1995;31(2):76-83.
Ahlswede, R., Bassalygo, L. A., & Pinsker, M. S. (1995). Asymptotically optimal binary codes of polynomial complexity correcting localized errors. Probl. Peredachi Inf., 31(2), 76-83.
Ahlswede, Rudolf, Bassalygo, L. A., and Pinsker, M. S. 1995. “Asymptotically optimal binary codes of polynomial complexity correcting localized errors”. Probl. Peredachi Inf. 31 (2): 76-83.
Ahlswede, R., Bassalygo, L. A., and Pinsker, M. S. (1995). Asymptotically optimal binary codes of polynomial complexity correcting localized errors. Probl. Peredachi Inf. 31, 76-83.
Ahlswede, R., Bassalygo, L.A., & Pinsker, M.S., 1995. Asymptotically optimal binary codes of polynomial complexity correcting localized errors. Probl. Peredachi Inf., 31(2), p 76-83.
R. Ahlswede, L.A. Bassalygo, and M.S. Pinsker, “Asymptotically optimal binary codes of polynomial complexity correcting localized errors”, Probl. Peredachi Inf., vol. 31, 1995, pp. 76-83.
Ahlswede, R., Bassalygo, L.A., Pinsker, M.S.: Asymptotically optimal binary codes of polynomial complexity correcting localized errors. Probl. Peredachi Inf. 31, 76-83 (1995).
Ahlswede, Rudolf, Bassalygo, L. A., and Pinsker, M. S. “Asymptotically optimal binary codes of polynomial complexity correcting localized errors”. Probl. Peredachi Inf. 31.2 (1995): 76-83.
Alle Dateien verfügbar unter der/den folgenden Lizenz(en):
Copyright Statement:
Dieses Objekt ist durch das Urheberrecht und/oder verwandte Schutzrechte geschützt. [...]
Volltext(e)
Name
Access Level
Open Access
Zuletzt Hochgeladen
2019-09-06T08:48:33Z
MD5 Prüfsumme
a0345ee7c9304c5da4d2311d98482f1b
Google Scholar