[{"external_id":{"isi":["000078590700035"]},"page":"326-330","date_updated":"2018-07-24T13:00:39Z","_id":"1883870","intvolume":" 45","type":"journal_article","isi":"1","volume":"45","title":"Construction of uniquely decodable codes for the two-user binary adder channel","issue":"1","edit_mode":"expert","citation":{"frontiers":"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.","lncs":" Ahlswede, R., Balakirsky, V.: Construction of uniquely decodable codes for the two-user binary adder channel. IEEE Trans. Inf. Theory. 45, 326-330 (1999).","apa":"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.","angewandte-chemie":"R. Ahlswede, and V. Balakirsky, “Construction of uniquely decodable codes for the two-user binary adder channel”, *IEEE Trans. Inf. Theory*, **1999**, *45*, 326-330.","aps":" R. Ahlswede and V. Balakirsky, Construction of uniquely decodable codes for the two-user binary adder channel, IEEE Trans. Inf. Theory **45**, 326 (1999).","wels":"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.","harvard1":"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.","default":"Ahlswede R, Balakirsky V (1999)

*IEEE Trans. Inf. Theory* 45(1): 326-330.","mla":"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.","dgps":"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.

","bio1":"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.","ama":"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.","apa_indent":"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.

","chicago":"Ahlswede, Rudolf, and Balakirsky, Vladimir. 1999. “Construction of uniquely decodable codes for the two-user binary adder channel”. *IEEE Trans. Inf. Theory* 45 (1): 326-330.

","ieee":" 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."},"first_author":"Ahlswede, Rudolf","doi":"10.1109/18.746834","department":[{"_id":"10020"}],"publication":"IEEE Trans. Inf. Theory","publication_identifier":{"issn":["0018-9448"]},"date_created":"2015-12-18T10:37:28Z","status":"public","language":[{"iso":"eng"}],"author":[{"first_name":"Rudolf","last_name":"Ahlswede","id":"10479","full_name":"Ahlswede, Rudolf"},{"full_name":"Balakirsky, Vladimir","first_name":"Vladimir","last_name":"Balakirsky"}],"year":"1999"}]