Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback

Ahlswede R, Cai N (2002)
IEEE TRANSACTIONS ON INFORMATION THEORY 48(8): 2153-2162.

Zeitschriftenaufsatz | Veröffentlicht | Englisch
 
Download
Es wurde kein Volltext hochgeladen. Nur Publikationsnachweis!
Autor/in
Abstract / Bemerkung
Whereas the average error capacity region R-a for the multiple-access channel (MAC) W: X x Y --> Z has been known for a long time [1], very little is known about the capacity region R-m for the maximal error concept (as,predicted by Ahlswede in 1971). In spite of great efforts during the past three decades even for some special examples of deterministic MAC, for which the maximal error concept coincides with the concept of unique decodability, the progress has been slow. It is known that the permission of list codes can be of great help, even if list sizes are of negligible rates (cf. the arbitrarily varying channel (AVC) and, especially, Shannon's zero-error capacity problem for the one-way channels). Therefore, it is theoretically appealing to look at their regions R-m,R-l for the MAC. For a nice class of deterministic MAC, which we call "seminoisy," we completely characterized R-m,R- l. For these channels, the Y-input is determined uniquely by the output: Dueck's example with R-a not equal R-m and Vanroose's "noiseless binary switching MAC" with R-a = R-m fall into this class. Finally, for this class, the capacity region R-m,R- f, which concerns complete feedback, equals R-m,R- l.
Stichworte
feedback; average; listcodes; maximal and zero error probabilities; multiple-access channel (MAC)
Erscheinungsjahr
2002
Zeitschriftentitel
IEEE TRANSACTIONS ON INFORMATION THEORY
Band
48
Ausgabe
8
Seite(n)
2153-2162
ISSN
0018-9448
Page URI
https://pub.uni-bielefeld.de/record/1614063

Zitieren

Ahlswede R, Cai N. Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback. IEEE TRANSACTIONS ON INFORMATION THEORY. 2002;48(8):2153-2162.
Ahlswede, R., & Cai, N. (2002). Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback. IEEE TRANSACTIONS ON INFORMATION THEORY, 48(8), 2153-2162. doi:10.1109/TIT.2002.800477
Ahlswede, R., and Cai, N. (2002). Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback. IEEE TRANSACTIONS ON INFORMATION THEORY 48, 2153-2162.
Ahlswede, R., & Cai, N., 2002. Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback. IEEE TRANSACTIONS ON INFORMATION THEORY, 48(8), p 2153-2162.
R. Ahlswede and N. Cai, “Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback”, IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 48, 2002, pp. 2153-2162.
Ahlswede, R., Cai, N.: Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback. IEEE TRANSACTIONS ON INFORMATION THEORY. 48, 2153-2162 (2002).
Ahlswede, Rudolf, and Cai, Ning. “Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback”. IEEE TRANSACTIONS ON INFORMATION THEORY 48.8 (2002): 2153-2162.