A new bound for the zero-error capacity region of the two-user binary adder channel

IEEE Transactions on Information Theory

Volumn 51, Issue 9, 2005, Pages 3289-3291

  Mattas, Mikael ^a,b   Östergård, Patric R J ^a  

^a AALTO UNIVERSITY   (Finland)

^b TietoEnator Telecom and Media   (Finland)

Author keywords

Binary adder channel; Shannon capacity; Uniquely decodable (UD) code; Zero error capacity

Indexed keywords

BINARY CODES; BLOCK CODES; CHANNEL CAPACITY; DATA COMMUNICATION SYSTEMS; DECODING; SIGNAL ENCODING;

BINARY ADDED CHANNEL (BAC); SHANNON CAPACITY REGION; UNIQUELY DECODABLE (UD) CODE; ZERO-ERROR CAPACITY;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 26444552338     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2005.853309     Document Type: Article

References (16)

1. R. Ahlswede, "Multi-way communication channels," in Proc. 2nd Int. Symp. Information Theory (Tsahkadzor Armenian S.S.R., 1971). Budapest, Hungary: Publishing House of the Hungarian Academy of Sciences, 1973, pp. 23-52.
2. R. Ahlswede and V. B. Balakirsky, "Construction of uniquely decodable codes for the two-user binary adder channel," IEEE Trans. Inf. Theory, vol. 45, no. 1, pp. 326-330, Jan. 1999.
3. P. A. B. M. Coebergh van den Braak and H. C. A. van Tilborg, "A family of good uniquely decodable code pairs for the two-access binary adder channel," IEEE Trans. Inf. Theory, vol. IT-31, no. 1, pp. 3-9, Jan. 1985.
4. G. Cohen, S. Litsyn, A. Vardy, and G. Zémor, "Tilings of binary spaces," SIAM J. Discr. Math., vol. 9, pp. 393-412, 1996.
5. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
6. D. F. Fuccio, "Codes for the two-user binary adder channel," M.Sc. thesis, Dept. Elec. Commun. Eng., Helsinki Univ. Technol., Espoo, Finland, 2003.
7. T. Kasami, S. Lin, V. K. Wei, and S. Yamamura, "Graph theoretic approaches to the code construction for the two-user multiple-access binary adder channel," IEEE Trans. Inf. Theory, vol. IT-29, no. 1, pp. 114-130, Jan. 1983.
8. G. G. Khachatrian, "On the construction of codes for noiseless synchronized 2-user channel," Probl. Control Inf. Theory, vol. 11, pp. 319-324, 1982.
9. G. H. Khachatrian, "A survey of coding methods for the adder channel," in Numbers, Information and Complexity, I. Althöfer, N. Cai, G. Dueck, L. Khachatrian, M. S. Pinsker, A. Sárközy, I. Wegener, and Z. Zhang, Eds. Dordrecht, The Netherlands; Kluwer, 2000, pp. 181-196.
10. H. J. Liao, "Multiple-access channels," Ph.D. dissertation, Dep. Elec. Eng., Univ. Hawaii, Honolulu, HI, 1972.
11. S. Niskanen and P. R. J. Östergård, "Cliquer User's Guide, Version 1.0," Commun. Lab., Helsinki Univ. Technol., Espoo, Finland, Tech. Rep. T48, 2003.
12. P. R. J. Östergård and M. K. Kaikkonen, "New single-error-correcting codes," IEEE Trans. Inf. Theory, vol. 42, no. 4, pp. 1261-1262, Jul. 1996.
13. 2) for a two-access binary adder channel," IEEE Trans. Inf. Theory, vol. IT-29, no. 3, pp. 386-389, May 1983.
14. L. M. Tolhuizen, "New rate pairs in the zero-error capacity region of the binary multiplying channel without feedback," IEEE Trans. Inf. Theory, vol. 46, no. 3, pp. 1043-1046, May 2000.
15. R. Urbanke and Q. Li, "The zero-error capacity region of the 2-user synchronous BAC is strictly smaller than its Shannon capacity region," presented at the IEEE Information Theory Workshop, Killarney, Ireland, 1998.
16. E. J. Weldon Jr., "Coding for a multiple-access channel," Inform. Contr., vol. 36, pp. 256-274, 1978.