Skip to main content

Spherical Codes from Lattices

  • Chapter
  • First Online:
Advances in Mathematics and Applications

Abstract

Lattices are homogeneous discrete sets in the n-dimensional space that have been used in different applications in communication areas such as coding for Gaussian or fading channels and cryptography. This chapter approaches the connection between quotient of lattices and spherical codes, presenting a survey on contributions to this topic mainly based on Costa et al. (Flat tori, lattices and spherical codes. In: 2013 Information Theory and Applications Workshop (ITA), February 2013, pp 1–8), Siqueira and Costa (Des Codes Cryptogr 49(1–3):307–321, 2008), Torezzan et al. (IEEE Trans Inf Theory 59(10):6655–6663, 2013), Costa et al. (Lattice applied to codding for reliable and secure communications. Springer, 2017), and Torezzan et al. (Des Codes Cryptogr 74(2):379–394, 2015).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. J. Almeida, C. Torezzan, and J. Barros. Spherical codes for the gaussian wiretap channel with continuous input alphabets. In IEEE 14th Workshop on Signal Processing Advances in Wireless Communications, 2013.

    Google Scholar 

  2. C. Alves and S. I. R. Costa. Commutative group codes in \(\mathbb {R}^4\), \(\mathbb {R}^6\), \(\mathbb {R}^8\) and \(\mathbb {R}^{16}\) approaching the bound. Discrete Mathematics, 313(16):1677–1687, 2013.

    Google Scholar 

  3. E. Biglieri and M. Elia. Cyclic-group codes for the gaussian channel. IEEE Transaction on Information Theory, 22(5):624–629, Sept. 1976.

    Article  MathSciNet  Google Scholar 

  4. G. Caire and E. Biglieri. Linear block codes over cyclic groups. IEEE Transaction on Information Theory, 41(5):1246–1256, Sept. 1995.

    Article  MathSciNet  Google Scholar 

  5. A. Campello, G. C. Jorge, J. E. Strapasson, and S. I. R. Costa. Perfect codes in the p metric. European Journal of Combinatorics, 53:72–85, 2016.

    Article  MathSciNet  Google Scholar 

  6. A. Campello and J. Strapasson. On sequences of projections of the cubic lattice. Computational and Applied Mathematics, 32(1):57–69, Apr. 2013.

    Article  MathSciNet  Google Scholar 

  7. A. Campello, J. Strapasson, and S. I. R. Costa. On projections of arbitrary lattices. Linear Algebra and its Applications, 439(9):2577–2583, 2013.

    Article  MathSciNet  Google Scholar 

  8. A. Campello, C. Torezzan, and S. I. R. Costa. Curves on flat tori and analog source-channel codes. IEEE Transactions on Information Theory, 59(10):6646–6654, Oct. 2013.

    Article  MathSciNet  Google Scholar 

  9. H. Cohen. A Course in Computational Algebraic Number Theory. Springer Berlin Heidelberg, 1993.

    Book  Google Scholar 

  10. J. H. Conway and N. J. A. Sloane. Sphere packings, lattices and groups, volume 290 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer-Verlag, New York, third edition, 1999. With additional contributions by E. Bannai, R. E. Borcherds, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov.

    Google Scholar 

  11. S. I. R. Costa, E. Agustini, M. Muniz, and R. Palazzo. Slepian-type codes on a flat torus. In Proc. IEEE International Symposium on Information Theory, page 58, 25–30 June 2000.

    Google Scholar 

  12. S. I. R. Costa, M. Muniz, E. Agustini, and R. Palazzo. Graphs, tessellations, and perfect codes on flat tori. IEEE Transactions on Information Theory, 50(10):2363–2377, Oct. 2004.

    Article  MathSciNet  Google Scholar 

  13. S. I. R. Costa, F. Oggier, A. Campello, J-C. Befiore, and E. Viterbo. Lattice Applied to Codding for Reliable and Secure Communications. Springer, 2017.

    Google Scholar 

  14. S. I. R. Costa, J. E. Strapasson, M. M. S. Alves, and Carlos T. B. Circulant graphs and tesselations on flat tori. Linear Algebra and Its Applications, 432:369–382, 2010.

    Google Scholar 

  15. S. I. R. Costa, J. E. Strapasson, R. M. Siqueira, and M. Muniz. Circulant graphs, lattices and spherical codes. International Journal of Applied Mathematics., 20:581–594, 2007.

    MathSciNet  MATH  Google Scholar 

  16. S. I. R. Costa, C. Torezzan, A. Campello, and V. A. Vaishampayan. Flat tori, lattices and spherical codes. In 2013 Information Theory and Applications Workshop (ITA), pages 1–8, Feb. 2013.

    Google Scholar 

  17. S. I. R. Costa. On closed twisted curves. Proceedings of the American Mathematical Society, 109(1):205–214, 1990.

    Article  MathSciNet  Google Scholar 

  18. A. C. de A. Campello, G. C. Jorge, and S. I. R. Costa. Decoding q-ary lattices in the lee metric. In 2011 IEEE Information Theory Workshop, pages 220–224, Oct. 2011.

    Google Scholar 

  19. T. Ericson and V. Zinoviev. Codes on Euclidean Spheres. North-Holland Mathematical Library, 2001.

    Google Scholar 

  20. A. A. El Gammal, L. A. Hemachandra, I. Shperling and V. K. Wei. Using simulated annealing to design good codes. IEEE Trans. Inf. Theor, 1987.

    Google Scholar 

  21. F. R. Gantmacher. The theory of matrices. Vol. 1. Transl. from the Russian by K. A. Hirsch. Reprint of the 1959 translation. Providence, RI: AMS Chelsea Publishing, 1998.

    MATH  Google Scholar 

  22. J. Hamkins and K. Zeger. Asymptotically dense spherical codes. i. wrapped spherical codes. IEEE Transactions on Information Theory, 43(6):1774–1785, Nov. 1997.

    Google Scholar 

  23. J. Hamkins and K. Zeger. Asymptotically dense spherical codes .ii. laminated spherical codes. IEEE Transactions on Information Theory, 43(6):1786–1798, Nov. 1997.

    Google Scholar 

  24. I. Ingemarsson. Group codes for the gaussian channel. In G. Einarsson, T. Ericson, I. Ingemarsson, R. Johannesson, K. Zigangirov, and C.-E. Sundberg, editors, Topics in Coding Theory, volume 128 of Lecture Notes in Control and Information Sciences, pages 73–108. Springer Berlin Heidelberg, 1989.

    Chapter  Google Scholar 

  25. G. D. Forney Jr. Geometrically uniform codes. IEEE Transactions on Information Theory, 37(5):1241–1260, 1991.

    Article  MathSciNet  Google Scholar 

  26. C. C. Lavor, M. M. S. Alves, R. M. Siqueira, and S. I. R. Costa. Uma intrdução à teoria de códigos. Number 21 in Notas em Matemática Aplicada. SBMAC, 2006.

    Google Scholar 

  27. H.-A. Loeliger. Signal sets matched to groups. IEEE Transactions on Information Theory, 37(6):1675 –1682, Nov. 1991.

    Google Scholar 

  28. D. Micciancio and O. Regev. Lattice-based Cryptography, pages 147–191. Springer Berlin Heidelberg, Berlin, Heidelberg, 2009.

    MATH  Google Scholar 

  29. C. Peikert. A decade of lattice cryptography. Foundations and Trends® in Theoretical Computer Science, 10(4):283–424, 2016.

    Article  MathSciNet  Google Scholar 

  30. R. Siqueira and S. I. Costa. Flat tori, lattices and bounds for commutative group codes. Designs Codes Cryptography, 49(1-3):307–321, December 2008.

    Article  MathSciNet  Google Scholar 

  31. D. Slepian. Group codes for the gaussian channel. The Bell System Technical Journal, 47: 575–602, 1968.

    Article  MathSciNet  Google Scholar 

  32. N. J. A. Sloane, V. A. Vaishampayan, and S. I. R. Costa. A note on projecting the cubic lattice. Discrete Computational Geometry, 46(3):472–478, October 2011.

    Article  MathSciNet  Google Scholar 

  33. J. Strapasson, S. Costa, and M. Muniz. A note on quadrangular embedding of abelian cayley graphs. Trends in Applied and Computational Mathematics, 17(3):331, 2016.

    Google Scholar 

  34. J. E. Strapasson. A note on sub-orthogonal lattices. Linear Algebra and its Applications, 543(15):31–41, 2018.

    Article  MathSciNet  Google Scholar 

  35. J. E. Strapasson, G. C. Jorge, A. Campello, and S. I. R. Costa. Quasi-perfect codes in the p metric. Computational and Applied Mathematics, Aug 2016.

    Google Scholar 

  36. J. E. Strapasson and C. Torezzan. A heuristic approach for designing cyclic group codes. International Transactions in Operational Research, 23(5):883–896, 2016.

    Article  MathSciNet  Google Scholar 

  37. R. M. Taylor, L. Mili, and A. Zaghloul. Structured spherical codes with asymptotically optimal distance distributions. In 2017 IEEE International Symposium on Information Theory (ISIT), pages 2188–2192, June 2017.

    Google Scholar 

  38. C. Torezzan, S. I. R. Costa, and V. A. Vaishampayan. Spherical codes on torus layers. International Symposium on Information Theory. 2009.

    Google Scholar 

  39. C. Torezzan, S. I. R. Costa, and V. A. Vaishampayan. Constructive spherical codes on layers of flat tori. IEEE Transactions on Information Theory, 59(10):6655–6663, Oct. 2013.

    Article  MathSciNet  Google Scholar 

  40. C. Torezzan, J. E. Strapasson, S. I. R. Costa, and Rogerio M. Siqueira. Optimum commutative group codes. Designs, Codes and Cryptography, 74(2):379–394, Feb 2015.

    Google Scholar 

  41. V. A. Vaishampayan and S. I. R. Costa. Curves on a sphere, shift-map dynamics, and error control for continuous alphabet sources. IEEE Transactions on Information Theory, 49(7):1658–1672, 2003.

    Article  MathSciNet  Google Scholar 

  42. V. A. Vaishampayan, N. J. A. Sloane, and S. I. R. Costa. Dynamical systems, curves and coding for continuous alphabet sources. In Proceedings International Telecommunications Symposium. ITW2002, Bangalore, 2002.

    Google Scholar 

  43. N. Wernersson, M. Skoglund, and T. Ramstad. Polynomial based analog source-channel codes. IEEE Transactions on Communications, 57(9):2600–2606, Sept. 2009.

    Article  Google Scholar 

  44. R. Zamir. Lattices are everywhere. In 2009 Information Theory and Applications Workshop, pages 392–421, Feb 2009.

    Google Scholar 

  45. R. Zamir. Lattice Coding for Signals and Networks: A Structured Coding Approach to Quantization, Modulation, and Multiuser Information Theory. Cambridge University Press, 2014.

    Book  Google Scholar 

Download references

Acknowledgements

The authors acknowledge all the support from IMECC-Unicamp and from FAPESP (2013/25977-7) and CNPq (312926/2013-8; 400441/2014-4) foundations. The first author wishes to thank her present and past students for their contributions on the subject discussed in this chapter.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sueli I. R. Costa .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Costa, S.I.R., Strapasson, J.E., Torezzan, C. (2018). Spherical Codes from Lattices. In: Lavor, C., Gomes, F. (eds) Advances in Mathematics and Applications. Springer, Cham. https://doi.org/10.1007/978-3-319-94015-1_5

Download citation

Publish with us

Policies and ethics