Channel coding and lossy source coding using a generator of constrained random numbers

IEEE Transactions on Information Theory

Volumn 60, Issue 5, 2014, Pages 2667-2686

  Muramatsu, Jun ^a  

^a NTT Corporation   (Japan)

Author keywords

channel coding; information spectrum methods; LDPC codes; lossy source coding; Shannon theory

Indexed keywords

RANDOM NUMBER GENERATION; STOCHASTIC SYSTEMS;

GENERAL CHANNELS; INFORMATION SPECTRUM; LDPC CODES; LOSSY SOURCE CODES; LOSSY SOURCE CODING; RATE DISTORTION REGION; SHANNON THEORY; SPARSE MATRICES;

CHANNEL CODING;

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

References (36)

1. S. M. Aji and R. J. McEliece,"The generalized distributive law,"IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 325-343, Mar. 2000.
2. R. Ahlswede and I. Csiszr,"Common randomness in information theory and cryptography-Part II: CR capacity,"IEEE Trans. Inf. Theory, vol. 44, no. 1, pp. 225-240, Jan. 1998. (Pubitemid 128737891)
3. A. Bennatan and D. Burshtein,"On the application of LDPC codes to arbitrary discrete-memoryless channels,"IEEE Trans. Inf. Theory, vol. 50, no. 3, pp. 417-438, Mar. 2004.
4. T. M. Cover,"A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.),"IEEE Trans. Inform Theory, vol. 21, no. 2, pp. 226-228, Mar. 1975.
5. T. M. Cover and J. A. Thomas, Elements of Information Theory, 2nd. ed. New York, NY, USA: Wiley, 2006.
6. I. Csiszr,"Linear codes for sources and source networks: Error exponents, universal coding,"IEEE Trans. Inf. Theory, vol. 28, no. 4, pp. 585-592, Jul. 1982.
7. I. Csiszr and J. Krner, Information Theory: Coding Theorems for Discrete Memoryless Systems, 2nd. ed. Cambridge, U.K.: Cambridge Univ. Press, 2011.
8. I. Csiszr and P. Narayan,"Secret key capacity for multiple terminals,"IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3047-3061, Dec. 2004.
9. J. L. Carter and M. N. Wegman,"Universal classes of hash functions,"J. Comput. Syst. Sci., vol. 18, no. 2, pp. 143-154, 1979.
10. A. El Gamal and Y. H. Kim, Network Information Theory. Cambridge, U.K.: Cambridge Univ. Press, 2011.
11. J. Feldman, M. J. Wainwright, and D. R. Karger,"Using linear programming to decode binary linear codes,"IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 954-972, Mar. 2005. (Pubitemid 40377560)
12. R. G. Gallager, Information Theory and Reliable Communication. New York, NY, USA: Wiley, 1968.
13. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA, USA: MIT Press, 1963.
14. A. Gupta and S. Verd,"Nonlinear sparse-graph codes for lossy compression,"IEEE Trans. Inf. Theory, vol. 55, no. 5, pp. 1961-1975, May 2009.
15. T. S. Han and S. Verd,"Approximation theory of output statistics,"IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 752-772, May 1993.
16. T. S. Han, Information-Spectrum Methods in Information Theory. New York, NY, USA: Springer-Verlag, 2003.
17. T. S. Han and M. Hoshi,"Interval algorithm for random number generation,"IEEE Trans. Inf. Theory, vol. 43, no. 2, pp. 599-611, Mar. 1997. (Pubitemid 127827978)
18. H. Koga,"Coding theorems on the threshold scheme for a general source,"IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2658-2677, Jun. 2008.
19. F. R. Kschischang, B. J. Frey, and H. A. Loeliger,"Factor graphs and the sum-product algorithm,"IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
20. D. J. C. MacKay,"Good error-correcting codes based on very sparse matrices,"IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
21. Y. Matsunaga and H. Yamamoto,"A coding theorem for lossy data compression by LDPC codes,"IEEE Trans. Inf. Theory, vol. 49, no. 9, pp. 2225-2229, Sep. 2003.
22. J. Muramatsu, T. Uyematsu, and T. Wadayama,"Low density parity check matrices for coding of correlated sources,"IEEE Trans. Inf. Theory, vol. 51, no. 10, pp. 3645-3653, Oct. 2005.
23. J. Muramatsu and S. Miyake,"Hash property and coding theorems for sparse matrices and maximal-likelihood coding,"IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2143-2167, May 2010.
24. J. Muramatsu and S. Miyake,"Construction of Slepian-Wolf source code and broadcast channel code based on hash property,"IEEE Trans. Inf. Theory, 2010, to be published.
25. J. Muramatsu and S. Miyake,"Construction of broadcast channel code based on hash property,"in Proc. IEEE Int. Symp. Inf. Theory, Austin, TX, USA, Jun. 2010, pp. 575-579.
26. J. Muramatsu and S. Miyake,"Construction of strongly secure wiretap channel code based on hash property,"in Proc. IEEE Int. Symp. Inf. Theory, St. Petersburg, Russia, Aug. 2011, pp. 612-616.
27. J. Muramatsu and S. Miyake,"Construction of multiple-access channel codes based on hash property,"in Proc. IEEE Int. Symp. Inf. Theory, St. Petersburg, Russia, Aug. 2011, pp. 2274-2278.
28. T. Murayama,"Thouless-Anderson-Palmer approach for lossy compression,"Phys. Rev. E, vol. 69, no. 3, p. 035105, 2004.
29. Y. Steinberg and S. Verd,"Simulation of random process and ratedistortion theory,"IEEE Trans. Inf. Theory, vol. 42, no. 1, pp. 63-86, Jan. 1996. (Pubitemid 126775658)
30. J. M. Renes and R. Renner,"Noisy channel coding via privacy amplification and information reconciliation,"IEEE Trans. Inf. Theory, vol. 57, no. 11, pp. 7377-7385, Nov. 2011.
31. J. Rissanen and G. G. Langdon,"Arithmetic coding,"IBM J. Res. Develop., vol. 23, no. 2, pp. 149-162, 1976.
32. C. E. Shannon,"A mathematical theory of communication,"Bell Syst. Tech. J., vol. 27, no. 3, pp. 379-423, 1948.
33. D. Slepian and J. K. Wolf,"Noiseless coding of correlated information sources,"IEEE Trans. Inf. Theory, vol. 19, no. 4, pp. 471-480, Jul. 1973.
34. S. Verd and T. S. Han,"A general formula for channel capacity,"IEEE Trans. Inf. Theory, vol. 40, no. 4, pp. 1147-1157, Jul. 1994.
35. M. Wainwright and E. Martinian,"Low density graph codes that are optimal for binning and coding with side information,"IEEE Trans. Inf. Theory, vol. 55, no. 3, pp. 1061-1079, Mar. 2009.
36. M. H. Yassaee, M. R. Aref, and A. Gohari,"Achievability proof via output statistics of random binning,"in Proc. IEEE Int. Symp. Inf. Theory, Cambridge, MA, USA, Jul. 2012, pp. 1049-1053.