Construction of multiple access channel codes based on hash property

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2011, Pages 2263-2267

  Muramatsu, Jun ^a   Miyake, Shigeki ^b  

^a NTT Corporation   (Japan)

^b NTT Network Innovation Laboratories   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CODE CONSTRUCTION; MULTIPLE ACCESS CHANNELS; SPARSE MATRICES;

COMMUNICATION CHANNELS (INFORMATION THEORY);

CODES (SYMBOLS);

EID: 80054794093     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6033964     Document Type: Conference Paper

References (16)

1. R. Ahlswede, "Multi-way communication channels", Proc. 2nd International Symposium on Information Theory, Tsahkadsor Armenian SSR, pp. 23-52, 1971.
2. A. de Baynast and D. Declercq, "Gallager codes for multiple user applications", Proc. 2002 International Symposium on Information Theory, Lausannne, Switzerland, p. 335, 2002.
3. T. M. Cover, "A proof of the data compression theorem of Slepian and Wolf for ergodic sources", IEEE Trans. Inform Theory, vol. IT-21, no. 2, pp. 226-228, Mar. 1975.
4. T. M. Cover and J. A. Thomas, Elements of Information Theory 2nd. Ed., John Wiley & Sons, Inc., 2006.
5. I. Csiszár, "Linear codes for sources and source networks: Error exponents, universal coding", IEEE Trans. Inform. Theory, vol. IT-28, no. 4, pp. 585-592, Jul. 1982.
6. J. L. Carter and M. N. Wegman, "Universal classes of hash functions", J. Comput. Syst. Sci., vol. 18, pp. 143-154, 1979.
7. A. El Gamal and Y. H. Kim, "Lecture notes on network information theory", available at arXiv:1001.3404[cs. IT], 2010.
8. T. S. Han, "The capacity region of general multiple-access channel with certain correlated sources", Inform. Contr., vol. 40, pp. 37-60, 1979.
9. H. Liao, Multiple Access Channels, Ph. D. thesis, Department of Electrical Engineering, University of Hawaii, Honolulu, 1972.
10. R. J. McEliece, "Are Turbo-like codes effective on nonstarndard channels?" IEEE Information Thoery Society Newsletter, vol. 51, no. 4, p. 1 and pp. 3-8, 2001.
11. J. Muramatsu, T. Uyematsu, and T. Wadayama, "Low density parity check matrices for coding of multiple access networks", Proc. IEEE Information Theory Workshop, Paris, France, pp. 304-307, 2003.
12. J. Muramatsu and S. Miyake, "Hash property and coding theorems for sparse matrices and maximal-likelihood coding", IEEE Trans. Inform. Theory, vol. IT-56, no. 5, pp. 2143-2167, May 2010.
13. Corrections: vol. IT-56, no. 9, p. 4762, Sept. 2010.
14. J. Muramatsu and S. Miyake, "Hash property and fixed-rate universal coding theorems", IEEE Trans. Inform. Theory, vol. IT-56, no. 6, pp. 2688-2698, Jun. 2010.
15. J. Muramatsu and S. Miyake "Construction of Slepian-Wolf source code and broadcast channel code based on hash property", submitted to IEEE Trans. Inform. Theory, available at arXiv:1006.5271[cs. IT], 2010.
16. D. Slepian and J. K. Wolf, "A coding theorem for multiple access channels with correlated sources", Bell System Technical Journal, vol. 52, no. 7, pp. 1037-1076, Sep. 1973.