# Lattices and Index Coding

## Abstract

A wireless channel is characterized by its broadcast nature: a signal transmitted by a source is received not only by the intended recipient but also by all the terminals within the transmission range. This can create a scenario where a passive listener becomes aware of the message originally intended for another node in the broadcast network, while the intended recipient himself is yet to receive the message packet successfully. This might occur, for example, if the main recipient is out of transmission range or if the packet is lost due to fading or channel noise, while the channel gain at the passive listener is strong enough for decoding to be successful. As a result, we have a broadcast channel where the source is required to transmit a finite set of messages intended to be delivered to finitely many receivers, each receiver desires to decode a subset of the transmitted messages while having prior knowledge of the values of a different subset of messages. This prior knowledge at the receivers, called *side information* , can arise when receivers overhear the previous transmissions as information propagates through a communication network in multiple hops or through multiple rounds of transmission.

## References

- 5.F. Arbabjolfaei, Y.H. Kim, Local time sharing for index coding, in
*IEEE International Symposium on Information Theory*(2014), pp. 286–290Google Scholar - 7.Z. Bar-Yossef, Y. Birk, T.S. Jayram, T. Kol, Index coding with side information. IEEE Trans. Inf. Theory
**57**(3), 1479–1494 (2011)MathSciNetCrossRefzbMATHGoogle Scholar - 12.Y. Birk, T. Kol, Informed-source coding-on-demand (ISCOD) over broadcast channels, in
*Proceedings of IEEE Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM ’98*, vol. 3 (1998), pp. 1257–1264Google Scholar - 13.A. Blasiak, R. Kleinberg, E. Lubetzky, Broadcasting with side information: bounding and approximating the broadcast rate. IEEE Trans. Inf. Theory
**59**(9), 5811–5823 (2013)MathSciNetCrossRefzbMATHGoogle Scholar - 26.J.H. Conway, N.J.A. Sloane,
*Sphere-Packings, Lattices, and Groups*(Springer, New York, 1998)zbMATHGoogle Scholar - 34.M. Effros, S. El Rouayheb, M. Langberg, An equivalence between network coding and index coding. IEEE Trans. Inf. Theory
**61**(5), 2478–2487 (2015)MathSciNetCrossRefzbMATHGoogle Scholar - 36.S. El Rouayheb, A. Sprintson, C. Georghiades, On the index coding problem and its relation to network coding and matroid theory. IEEE Trans. Inf. Theory
**56**(7), 3187–3195 (2010)MathSciNetCrossRefzbMATHGoogle Scholar - 41.G.D. Forney, Multidimensional constellations. ii. voronoi constellations. IEEE J. Sel. Areas Commun.
**7**(6), 941–958 (1989)Google Scholar - 51.Y.C. Huang, Lattice index codes from algebraic number fields. IEEE Trans. Inf. Theory
**63**(4), 2098–2112 (2017)MathSciNetCrossRefzbMATHGoogle Scholar - 52.Y.C. Huang, K.R. Narayanan, Multistage compute-and-forward with multilevel lattice codes based on product constructions, in
*IEEE International Symposium on Information Theory*(2014), pp. 2112–2116Google Scholar - 55.S.A. Jafar, Topological interference management through index coding. IEEE Trans. Inf. Theory
**60**(1), 529–568 (2014)MathSciNetCrossRefzbMATHGoogle Scholar - 67.H. Maleki, V.R. Cadambe, S.A. Jafar, Index coding – an interference alignment perspective. IEEE Trans. Inf. Theory
**60**(9), 5402–5432 (2014)MathSciNetCrossRefzbMATHGoogle Scholar - 69.A. Mazumdar, On a duality between recoverable distributed storage and index coding, in
*IEEE International Symposium on Information Theory*(2014), pp. 1977–1981Google Scholar - 74.L. Natarajan, Y. Hong, E. Viterbo, Index codes for the Gaussian broadcast channel using quadrature amplitude modulation. IEEE Commun. Lett.
**19**(8), 1291–1294 (2015)CrossRefGoogle Scholar - 75.L. Natarajan, Y. Hong, E. Viterbo, Lattice index coding. IEEE Trans. Inf. Theory
**61**(12), 6505–6525 (2015)MathSciNetCrossRefzbMATHGoogle Scholar - 76.B. Nazer, M. Gastpar, Compute-and-forward: harnessing interference through structured codes. IEEE Trans. Inf. Theory
**57**(10), 6463–6486 (2011)MathSciNetCrossRefzbMATHGoogle Scholar - 78.M.J. Neely, A.S. Tehrani, Z. Zhang, Dynamic index coding for wireless broadcast networks. IEEE Trans. Inf. Theory
**59**(11), 7525–7540 (2013)CrossRefGoogle Scholar - 87.K.H. Rosen,
*Elementary Number Theory and Its Applications*(Addison-Wesley, Boston, 2005)Google Scholar - 92.K. Shanmugam, A.G. Dimakis, Bounding multiple unicasts through index coding and locally repairable codes, in
*IEEE International Symposium on Information Theory*(2014), pp. 296–300Google Scholar - 93.K. Shanmugam, A.G. Dimakis, M. Langberg, Graph theory versus minimum rank for index coding, in
*IEEE International Symposium on Information Theory*(2014), pp. 291–295Google Scholar - 104.C. Thapa, L. Ong, S.J. Johnson, Generalized interlinked cycle cover for index coding, in
*2015 IEEE Information Theory Workshop - Fall (ITW)*(2015), pp. 4–8Google Scholar - 112.R. Zamir,
*Lattice Coding for Signals and Networks: A Structured Coding Approach to Quantization, Modulation, and Multiuser Information Theory*(Cambridge University Press, Cambridge, 2014)CrossRefzbMATHGoogle Scholar