publication . Article . Preprint . 2012

Universal Communication—Part II: Channels With Memory

Lomnitz, Yuval; Feder, Meir;
Restricted
  • Published: 02 Feb 2012 Journal: IEEE Transactions on Information Theory, volume 60, pages 3,733-3,747 (issn: 0018-9448, eissn: 1557-9654, Copyright policy)
  • Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Consider communication over a channel whose probabilistic model is completely unknown vector-wise and is not assumed to be stationary. Communication over such channels is challenging because knowing the past does not indicate anything about the future. The existence of reliable feedback and common randomness is assumed. In a previous paper, it was shown that the Shannon capacity cannot be attained, in general, if the channel is not known. An alternative notion of capacity was defined, as the maximum rate of reliable communication by any block-coding system used over consecutive blocks. This rate was shown to be achievable for the modulo-additive channel with an ...
Subjects
arXiv: Computer Science::Information Theory
ACM Computing Classification System: Data_CODINGANDINFORMATIONTHEORY
free text keywords: Library and Information Sciences, Information Systems, Computer Science Applications, Binary erasure channel, Fading, Topology, Decoding methods, Telecommunications, business.industry, business, Discrete mathematics, Block code, Shannon–Hartley theorem, symbols.namesake, symbols, Computer science, Channel capacity, Spatial correlation, Communication channel, Computer Science - Information Theory
Related Organizations

[1] A. Lapidoth and P. Narayan, “Reliable communication under channel uncertainty,” IEEE Trans. Information Theory, vol. 44, no. 6, pp. 2148- 2177, Oct. 1998.

[2] O. Shayevitz and M. Feder, “Achieving the empirical capacity using feedback: Memoryless additive models,” IEEE Trans. Information Theory, vol. 55, no. 3, pp. 1269 -1295, Mar. 2009. [OpenAIRE]

[3] K. Eswaran, A. Sarwate, A. Sahai, and M. Gastpar, “Zero-rate feedback can achieve the empirical capacity,” IEEE Trans. Information Theory, vol. 58, no. 1, Jan. 2010.

[4] Y. Lomnitz and M. Feder. (2010, Dec.) Universal communication part I: modulo additive channels. arXiv:1012.2751v1 [cs.IT]. Submitted to IEEE-IT. [Online]. Available: http://arxiv.org/abs/1012.2751 [OpenAIRE]

[5] --. (2011, Sep.) Universal communication over arbitrarily varying channels. arXiv:1102.0710 [cs.IT]. Accepted for publication in IEEE-IT. [Online]. Available: http://arxiv.org/abs/1102.0710

[6] A. Lapidoth and I. Telatar, “The compound channel capacity of a class of finite-state channels,” IEEE Trans. Information Theory, vol. 44, no. 3, pp. 973 -983, May 1998.

[7] Y. Lomnitz and M. Feder, “Communication over individual channels,” IEEE Trans. Information Theory, vol. 57, no. 11, pp. 7333 -7358, Nov. 2011. [OpenAIRE]

[8] S. Verdu´ and T. Han, “A general formula for channel capacity,” IEEE Trans. Information Theory, vol. 40, no. 4, pp. 1147 -1157, Jul. 1994.

[9] J. Ziv and A. Lempel, “Compression of individual sequences via variable-rate coding,” IEEE Trans. Information Theory, vol. 24, no. 5, pp. 530 - 536, Sep. 1978. [OpenAIRE]

[10] R. Gallager, Information Theory and Reliable Communication. John Wiley & sons, 1968.

[11] V. Misra and T. Weissman, “The porosity of additive noise sequences,” in IEEE Int. Symp. Information Theory (ISIT), 2012.

[12] Y. Lomnitz, “Universal communication over unknown channels,” Ph.D. dissertation, Tel Aviv University, Aug. 2012, available online http: //www.eng.tau.ac.il/ yuvall/publications/YuvalL Phd report.pdf. [OpenAIRE]

[13] V. Misra and T. Weissman. (2012) The porosity of additive noise sequences. [Online]. Available: http://arxiv.org/abs/1205.6974

[14] S. Shamai and S. Verdu, “The empirical distribution of good codes,” IEEE Trans. Information Theory, vol. 43, no. 3, pp. 836 -846, May 1997.

Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue
publication . Article . Preprint . 2012

Universal Communication—Part II: Channels With Memory

Lomnitz, Yuval; Feder, Meir;