Construction of uniquely decodable codes for the two-user binary adder channel

Ahlswede R, Balakirsky V (1999)
IEEE Trans. Inf. Theory 45(1): 326-330.

Download
Es wurde kein Volltext hochgeladen. Nur Publikationsnachweis!
Zeitschriftenaufsatz | Englisch
Autor
;
Erscheinungsjahr
Zeitschriftentitel
IEEE Trans. Inf. Theory
Band
45
Zeitschriftennummer
1
Seite
326-330
ISSN
PUB-ID

Zitieren

Ahlswede R, Balakirsky V. Construction of uniquely decodable codes for the two-user binary adder channel. IEEE Trans. Inf. Theory. 1999;45(1):326-330.
Ahlswede, R., & Balakirsky, V. (1999). Construction of uniquely decodable codes for the two-user binary adder channel. IEEE Trans. Inf. Theory, 45(1), 326-330.
Ahlswede, R., and Balakirsky, V. (1999). Construction of uniquely decodable codes for the two-user binary adder channel. IEEE Trans. Inf. Theory 45, 326-330.
Ahlswede, R., & Balakirsky, V., 1999. Construction of uniquely decodable codes for the two-user binary adder channel. IEEE Trans. Inf. Theory, 45(1), p 326-330.
R. Ahlswede and V. Balakirsky, “Construction of uniquely decodable codes for the two-user binary adder channel”, IEEE Trans. Inf. Theory, vol. 45, 1999, pp. 326-330.
Ahlswede, R., Balakirsky, V.: Construction of uniquely decodable codes for the two-user binary adder channel. IEEE Trans. Inf. Theory. 45, 326-330 (1999).
Ahlswede, Rudolf, and Balakirsky, Vladimir. “Construction of uniquely decodable codes for the two-user binary adder channel”. IEEE Trans. Inf. Theory 45.1 (1999): 326-330.