publication . Article . Preprint . 2014

lattice index coding

Natarajan, Lakshmi; Hong, Yi; Viterbo, Emanuele;
Open Access
  • Published: 24 Oct 2014 Journal: IEEE Transactions on Information Theory, volume 61, pages 6,505-6,525 (issn: 0018-9448, eissn: 1557-9654, Copyright policy)
  • Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Comment: Accepted for publication in the IEEE Transactions on Information Theory. Two-column format, 21 pages
Subjects
arXiv: Computer Science::Information Theory
free text keywords: Communication channel, Code (cryptography), Combinatorics, Integer, Gaussian integer, symbols.namesake, symbols, Eisenstein integer, Modulo, Discrete mathematics, Gaussian, Chinese remainder theorem, Computer science, Computer Science - Information Theory
27 references, page 1 of 2

[1] Y. Birk and T. Kol, “Informed-source coding-on-demand (ISCOD) over broadcast channels,” in Proc. 17th Annu. Joint Conf. IEEE Computer and Communications Societies (INFOCOM), vol. 3, Mar. 1998, pp. 1257-1264.

[2] Z. Bar-Yossef, Y. Birk, T. S. Jayram, and T. Kol, “Index coding with side information,” IEEE Trans. Inf. Theory, vol. 57, no. 3, pp. 1479-1494, Mar. 2011.

[3] N. Alon, E. Lubetzky, U. Stav, A. Weinstein, and A. Hassidim, “Broadcasting with side information,” in Proc. 49th IEEE Symp. Foundations of Computer Science (FOCS), Oct. 2008, pp. 823-832. [OpenAIRE]

[4] S. El Rouayheb, A. Sprintson, and C. Georghiades, “On the index coding problem and its relation to network coding and matroid theory,” IEEE Trans. Inf. Theory, vol. 56, no. 7, pp. 3187-3195, Jul. 2010.

[5] A. Blasiak, R. D. Kleinberg, and E. Lubetzky, “Index coding via linear programming,” arXiv preprint, 2010. [Online]. Available: http://arxiv.org/abs/1004.1379 [OpenAIRE]

[6] S. Unal and A. Wagner, “General index coding with side information: Three decoder case,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Jul. 2013, pp. 1137-1141.

[7] Y. Wu, “Broadcasting when receivers know some messages a priori,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Jun. 2007, pp. 1141-1145.

[8] G. Kramer and S. Shamai, “Capacity for classes of broadcast channels with receiver side information,” in Proc. IEEE Information Theory Workshop (ITW), Sep. 2007, pp. 313-318.

[9] L.-L. Xie, “Network coding and random binning for multi-user channels,” in Proc. 10th Canadian Workshop on Information Theory (CWIT), Jun. 2007, pp. 85-88.

[10] J. W. Yoo, T. Liu, and F. Xue, “Gaussian broadcast channels with receiver message side information,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Jun. 2009, pp. 2472-2476.

[11] J. Sima and W. Chen, “Joint network and Gelfand-Pinsker coding for 3-receiver Gaussian broadcast channels with receiver message side information,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Jun. 2014, pp. 81-85.

[12] B. Asadi, L. Ong, and S. Johnson, “The capacity of three-receiver AWGN broadcast channels with receiver message side information,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Jun. 2014, pp. 2899-2903.

[13] T. Oechtering, M. Wigger, and R. Timo, “Broadcast capacity regions with three receivers and message cognition,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Jul. 2012, pp. 388-392. [OpenAIRE]

[14] E. Tuncel, “Slepian-Wolf coding over broadcast channels,” IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1469-1482, Apr. 2006. [OpenAIRE]

[15] L. Xiao, T. Fuja, J. Kliewer, and D. Costello, “Nested codes with multiple interpretations,” in Proc. 40th Annu. Conf. Information Sciences and Systems (CISS), Mar. 2006, pp. 851-856.

27 references, page 1 of 2
Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue
publication . Article . Preprint . 2014

lattice index coding

Natarajan, Lakshmi; Hong, Yi; Viterbo, Emanuele;