Skip to main content
SpringerLink
Log in

On Senary Simplex Codes

  • Conference paper
  • First Online:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2227))

Abstract

This paper studies senary simplex codes of type α and two punctured versions of these codes (type β and γ). Self-orthogonality, torsion codes, weight distribution and weight hierarchy properties are studied. We give a new construction of senary codes via their binary and ternary counterparts, and show that type α and β simplex codes can be constructed by this method.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

References

  1. Bannai E., Dougherty S.T., Harada M. and Oura M., Type II codes, even unimodular lattices and invariant rings. IEEE Trans. Inform. Theory 45 (1999), 1194–1205.

    Article  MATH  MathSciNet  Google Scholar 

  2. Bhandari M. C., Gupta M. K. and Lal, A. K. On Z4 simplex codes and their gray images Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-13, Lecture Notes in Computer Science 1719 (1999), 170–180.

    Chapter  Google Scholar 

  3. Brouwer, A.E., Hamalainen, H.O., Östergärd, P.R.J. and Sloane, N.J.A. Bounds on mixed binary/ternary codes. IEEE Trans. Inform. Theory 44 Jan. 1998, 140–161.

    Google Scholar 

  4. Chen, C. J., Chen T. Y. and Loeliger, H. A. Construction of linear ring codes for 6 PSK. IEEE Trans. Inform. Theory 40 (1994), 563–566.

    Article  MATH  MathSciNet  Google Scholar 

  5. Dougherty S.T., Gulliver T.A. and Harada M., Type II codes over finite rings and even unimodular lattices. J. Alg. Combin., 9 (1999), 233–250.

    Article  MATH  MathSciNet  Google Scholar 

  6. Dougherty S.T., Harada M. and Solé P., Self-dual codes over rings and the Chinese Remainder Theorem. Hokkaido Math. J., 28 (1999), 253–283.

    MATH  MathSciNet  Google Scholar 

  7. Gulliver T.A. and Harada M., Double circulant self dual codes over Z2k. 44 (1998), 3105–3123.

    MATH  MathSciNet  Google Scholar 

  8. Gulliver T.A. and Harada M., Orthogonal frames in the Leech Lattice and a Type II code over Z22. J. Combin. Theory Ser. A (to appear).

    Google Scholar 

  9. A. R. Hammons, P. V. Kumar, A. R. Calderbank, N. J. A. Sloane, and P. Solé. The Z4-linearity of kerdock, preparata, goethals, and related codes. IEEE Trans. Inform. Theory, 40 (1994), 301–319.

    Article  MATH  MathSciNet  Google Scholar 

  10. Harada M., On the existence of extremal Type II codes over Z6. Des. Math. 223 (2000), 373–378.

    MATH  MathSciNet  Google Scholar 

  11. Harada M., Extremal Type II codes over Z6 and their lattices. (submitted).

    Google Scholar 

  12. Ling, S. and Solé P. Duadic Codes over Z2k. IEEE Trans. Inform. Theory, 47 (2001), 1581–1589.

    Article  MATH  MathSciNet  Google Scholar 

  13. Österg°ard, P. R. J., Classification of binary/ternary one-error-correcting codes Disc. Math. 223 (2000) 253–262.

    Article  Google Scholar 

  14. F.W. Sun and H. Leib, Multiple-Phase Codes for Detection Without Carrier Phase Reference IEEE Trans. Inform. Theory, vol 44 No. 4, 1477–1491 (1998).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Canterbury, Private Bag 4800, Christchurch, New Zealand

    Manish K. Gupta & David G. Glynn

  2. Department of Electrical and Computer Engineering, University of Victoria, P.O. Box 3055, V8W 3P6, STN CSC Victoria, B.C., Canada

    T. Aaron Gulliver

Authors
  1. Manish K. Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David G. Glynn
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. T. Aaron Gulliver
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, RMIT University, GPO Box 2476V, 3001, Melbourne, Australia

    Serdar Boztaş

  2. Department of Computing, Macquarie University, 2109, NSW, Australia

    Igor E. Shparlinski

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gupta, M.K., Glynn, D.G., Aaron Gulliver, T. (2001). On Senary Simplex Codes. In: Boztaş, S., Shparlinski, I.E. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2001. Lecture Notes in Computer Science, vol 2227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45624-4_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45624-4_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42911-1

  • Online ISBN: 978-3-540-45624-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation