[{"type":"journal_article","dini_type":"doc-type:article","isi":"1","_id":"1883870","_version":8,"date_updated":"2018-07-24T13:00:39Z","page":"326-330","external_id":{"isi":[]},"intvolume":" 45","author":[{"last_name":"Ahlswede","id":"10479","first_name":"Rudolf"},{"last_name":"Balakirsky","first_name":"Vladimir"}],"language":[{}],"status":"public","dc":{"rights":["info:eu-repo/semantics/closedAccess"],"title":["Construction of uniquely decodable codes for the two-user binary adder channel"],"creator":["Ahlswede, Rudolf","Balakirsky, Vladimir"],"source":["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."],"relation":["info:eu-repo/semantics/altIdentifier/doi/10.1109/18.746834","info:eu-repo/semantics/altIdentifier/issn/0018-9448","info:eu-repo/semantics/altIdentifier/wos/000078590700035"],"date":["1999"],"type":["info:eu-repo/semantics/article","doc-type:article","text"],"identifier":["https://pub.uni-bielefeld.de/record/1883870"],"language":["eng"]},"citation":{"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.","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.

","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.","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.

","default":"Ahlswede R, Balakirsky V (1999)

*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.","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.","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).","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.","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.","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).","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."},"edit_mode":"expert","issue":"1","uri_base":"https://pub.uni-bielefeld.de","creator":{"login":"riedel","id":"67994"},"volume":"45","publication_identifier":{"issn":[]},"date_created":"2015-12-18T10:37:28Z","department":[{"tree":[{"_id":"10020"}],"_id":"10020"}],"publication":"IEEE Trans. Inf. Theory","first_author":"Ahlswede, Rudolf"}]