Construction of broadcast channel code based on hash property

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2010, Pages 575-579

  Muramatsu, Jun ^a   Miyake, Shigeki ^b  

^a NTT Corporation   (Japan)

^b NTT Network Innovation Laboratories   (Japan)

Author keywords

Broadcast channel coding; Hash property; LDPC codes; Linear codes; Maximum likelihood decoding; Minimum divergence encoding; Shannon theory; Sparse matrix

Indexed keywords

BROADCAST CHANNELS; HASH PROPERTY; LDPC CODES; LINEAR CODES; MAXIMUM-LIKELIHOOD DECODING; MINIMUM-DIVERGENCE ENCODING; SHANNON THEORY; SPARSE MATRICES;

BROADCASTING; CHANNEL CODING; DECODING; ENCODING (SYMBOLS); INFORMATION THEORY; MAXIMUM LIKELIHOOD;

MATRIX ALGEBRA;

EID: 77955686629     PISSN: 21578103     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2010.5513527     Document Type: Conference Paper

References (16)

1. P. Berlin and D. Tuninetti, "LDPC codes for fading Gaussian broadcast channels," IEEE Trans. Inform. Theory, vol. IT-51, pp. 2173-2182, Jun. 2005.
2. T. M. Cover, "Broadcast Channels," IEEE Trans. Inform Theory, vol. IT-18, no. 1, pp. 2-14, Jan. 1972.
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. 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.
5. J. L. Carter and M. N. Wegman, "Universal classes of hash functions," J. Comput. Syst. Sci., vol. 18, pp. 143-154, 1979.
6. A. El Gamal and E. Van der Meulen, "A proof of Marton's coding theorem for the discrete memoryless broadcast channel," IEEE Trans. Inform. Theory, vol. IT-27, pp. 120-122, Jan. 1981.
7. A. A. Gohari and V. Anantharam, "Evaluation of Marton's inner bound for the general broadcast channel," Proc. 2009 IEEE Int. Symp. Inform. Theory, Seoul, Korea, Jun. 28-Jul. 3, 2009, pp. 2462-2466.
8. J. Feldman, M.J. Wainwright, and D.R. Karger, "Using linear programming to decode binary linear codes," IEEE Trans. Inform. Theory, vol. IT-51, no. 3, pp. 954-972, Mar. 2005.
9. B. E. Hajek and M. B. Pursley, "Evaluation of an achievable rate region for the broadcast channel," IEEE Trans. Inform. Theory, vol. IT-25, no. 1, pp. 36-46, Jan. 1979.
10. Y. Liang, G. Kramer, and S. Shamai(Shitz), "Capacity outer bounds for broadcast channels," Proc. 2008 IEEE Information Theory Workshop, Porto, Portugal, May 5-9, 2008, pp. 2-4.
11. K. Marton, "A coding theorem for the discrete memoryless broadcast channel," IEEE Trans. Inform. Theory, vol. IT-25, pp. 306-311, May 1979.
12. J. Muramatsu, T. Uyematsu, and T. Wadayama, "Low density parity check matrices for coding of correlated sources," IEEE Trans. Inform. Theory, vol. IT-51, no. 10, pp. 3645-3653, Oct. 2005.
13. 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.
14. C. Nair, "An outer bound for 2-receiver discrete memoryless broadcast channels," available at arXiv:0807.3593[cs.IT], 2008.
15. C. Nair and A. El Gamal, "An outer bound to the capacity region of the broadcast channel," IEEE Trans. Inform. Theory, vol. IT-53, pp.350-355, Jan. 2007.
16. M. Ramezani and M. Ardakani, "Disjoint LDPC coding for Gaussian broadcast channels," Proc. 2009 IEEE Int. Symp. Inform. Theory, Seoul, Korea, Jun. 28-Jul. 3, 2009, pp. 938-942.