Skip to main content
SpringerLink
Log in

Decoding Spherical Codes Generated by Binary Partitions of Symmetric Pointsets

  • Conference paper
Coding Theory, Cryptography and Related Areas

  • 394 Accesses

Abstract

Recently, Ericson and Zinoviev presented a clever, new construction for spherical codes for the Gaussian channel using ideas of code concatenation and set partitioning. This family of new spherical codes is generated from sets of binary codes using equally spaced symmetric pointsets on the real line. The family contains some of the best known spherical codes in terms of minimum distance. However, no efficient decoding algorithm is known for this new construction. In this paper, we present a new decoding algorithm for this family of spherical codes which is more efficient than maximum likelihood decoding.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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 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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. E. Biglieri and M. Elia, “On the existence of group codes for the Gaussian channel,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 399–402, May 1972.

    Article  MathSciNet  MATH  Google Scholar 

  2. E. Biglieri and M. Elia, “Optimum permutation modulation codes and their asymptotic performance,” IEEE Trans. Inform.Theory, vol. IT-22, no. 6, pp. 751–753, Nov. 1976.

    Article  MathSciNet  Google Scholar 

  3. I. F. Blake, “Distance properties of group codes for the Gaussian channel,” SIAM J. Appl. Math., vol.23, no.3, 1972.

    Google Scholar 

  4. H. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices, and Groups, New York: Springer Verlag, 1988.

    MATH  Google Scholar 

  5. C. P. Downey and J. K. Karlof, “On the existence of [M, n] Group codes for the Gaussian Channel with M and n Odd,” IEEE Trans. Inform. Theory, vol.IT-23, pp. 500–503, July 1977.

    Article  MathSciNet  Google Scholar 

  6. C. P. Downey and J. K. Karlof, “Optimal [M,3] Group Codes for the Gaussian Channel”, IEEE Trans, Inform. Theory, vol. IT-24, pp. 760–761, Nov. 1978.

    Article  MathSciNet  MATH  Google Scholar 

  7. T. Ericson and V. Zinoviev, “Spherical Codes Generated by Binary Partitions of Symmetric Pointsets,” IEEE Trans. Inform. Theory, vol. 41, no.1, Jan 1995.

    Google Scholar 

  8. G. D. Forney, “Generalized Minimum Distance Decoding,” IEEE Trans, Inform. Theory, vol.12, April 1966.

    Google Scholar 

  9. I. Ingemarsson, “Group Codes for the Gaussian Channel,” in Lecture Notes in Control and Inform. Sciences, vol.128, M. Thoma and A. Wyner, Eds. New York: Springer- Verlag, 1989.

    Google Scholar 

  10. J. K. Karlof, “Permutation Codes for the Gaussian Channel,” IEEE Trans. Inform. Theory, vol. 35, no.4, pp. 726–732, July 1989.

    Article  MathSciNet  MATH  Google Scholar 

  11. D. Slepian, “Permutation Modulation,” Proc. IEEE, vol.53, pp.228–236, Mar. 1965.

    Article  Google Scholar 

  12. D. Slepian, “group codes for the Gaussian channel,” Bell Syst. Tech. J., vol. 47, no. 4, pp. 575–602, Apr. 1968.

    MathSciNet  MATH  Google Scholar 

  13. A. Tucker, Applied Combinatorics, New York: John Wiley and Sons, 1995.

    MATH  Google Scholar 

  14. V. Zinoviev, S. Litsyn, and Portnoi, “Concatenated Codes in Euclidean Space,” Probl. Inform. Transm., vol.25, no.3, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, The University of North Carolina at Wilmington, 28403, Wilmington, NC, USA

    John K. Karlof

  2. Intelligent Information Systems, 27713, Durham, NC, USA

    Guodong >Liu

Authors
  1. John K. Karlof
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guodong >Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fachbereich Informatik, Technische Universität Darmstadt, Alexanderstrasse 10, 64283, Darmstadt, Germany

    Johannes Buchmann

  2. Department of Mathematics, Technical University of Denmark, Bldg. 303, 2800, Lyngby, Denmark

    Tom Høholdt

  3. Fachbereich 6, Mathematik und Informatik, Universität Gesamthochschule Essen, 45117, Essen, Germany

    Henning Stichtenoth

  4. Departamento de Matemáticas, Universidad Autónoma Metropolitana-Iztapalapa, Apartado Postal 55-532, C.P. 09340, México, D.F., México

    Horacio Tapia-Recillas

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karlof, J.K., >Liu, G. (2000). Decoding Spherical Codes Generated by Binary Partitions of Symmetric Pointsets. In: Buchmann, J., Høholdt, T., Stichtenoth, H., Tapia-Recillas, H. (eds) Coding Theory, Cryptography and Related Areas. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-57189-3_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-57189-3_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66248-8

  • Online ISBN: 978-3-642-57189-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation