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.

Journal Article | English

No fulltext has been uploaded

Author
;
Publishing Year
ISSN
PUB-ID

Cite this

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.
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Web of Science

View record in Web of Science®

Search this title in

Google Scholar