Bounds on algebraic code capacities for noisy channels. II

Ahlswede R, Gemma J (1971)
Information and Control 19(2): 146-158.

Zeitschriftenaufsatz | Veröffentlicht | Englisch
 
Download
OA
Autor/in
Abstract / Bemerkung
It was proved by Ahlswede (1971) that codes whose codewords form a group or even a linear space do not achieve Shannon's capacity for discrete memoryless channels even if the decoding procedure is arbitrary. Sharper results were obtained in Part I of this paper. For practical purposes, one is interested not only in codes which allow a short encoding procedure but also an efficient decoding procedure. Linear codes—the codewords form a linear space and the decoding is done by coset leader decoding — have a fairly efficient decoding procedure. But in order to achieve high rates the following slight generalization turns out to be very useful: We allow the encoder to use a coset of a linear space as a set of codewords. We call these codes shifted linear codes or coset codes. They were implicitly used by Dobrushin (1963). This new code concept has all the advantages of the previous one with respect to encoding and decoding efficiency and enables us to achieve positive rate on discrete memoryless channels whenever Shannon's channel capacity is positive and the length of the alphabet is less or equal to 5 (Theorem 3.1.1). (The result holds very likely also for all alphabets with a length a = ps, p prime, s positive integer). A disadvantage of the concepts of linear codes and of shifted linear codes is that they can be defined only for alphabets whose length is a prime power. In order to overcome this difficulty, we introduce generalized shifted linear codes. With these codes we can achieve a positive rate on arbitrary discrete memoryless channels if Shannon's capacity is positive (Theorem 3.2.1)
Erscheinungsjahr
1971
Zeitschriftentitel
Information and Control
Band
19
Ausgabe
2
Seite(n)
146-158
ISSN
ARRAY(0x8f64170)
Page URI
https://pub.uni-bielefeld.de/record/1775381

Zitieren

Ahlswede R, Gemma J. Bounds on algebraic code capacities for noisy channels. II. Information and Control. 1971;19(2):146-158.
Ahlswede, R., & Gemma, J. (1971). Bounds on algebraic code capacities for noisy channels. II. Information and Control, 19(2), 146-158. doi:10.1016/S0019-9958(71)90783-2
Ahlswede, R., and Gemma, J. (1971). Bounds on algebraic code capacities for noisy channels. II. Information and Control 19, 146-158.
Ahlswede, R., & Gemma, J., 1971. Bounds on algebraic code capacities for noisy channels. II. Information and Control, 19(2), p 146-158.
R. Ahlswede and J. Gemma, “Bounds on algebraic code capacities for noisy channels. II”, Information and Control, vol. 19, 1971, pp. 146-158.
Ahlswede, R., Gemma, J.: Bounds on algebraic code capacities for noisy channels. II. Information and Control. 19, 146-158 (1971).
Ahlswede, Rudolf, and Gemma, J. “Bounds on algebraic code capacities for noisy channels. II”. Information and Control 19.2 (1971): 146-158.
Alle Dateien verfügbar unter der/den folgenden Lizenz(en):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Volltext(e)
Access Level
OA Open Access
Zuletzt Hochgeladen
2019-09-06T08:48:17Z
MD5 Prüfsumme
aa9a88b6ae53a06d6038a96b46cf7031