Skip to main content
SpringerLink
Log in

On the State Complexities of Ternary Codes

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

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

Abstract

The paper studies self-orthogonal codes over GF(3). The state complexities ofs uch codes of lengths ≤ 20 with efficient coordinate ordering are found.

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. G. Cohen, S. Encheva and G. Zémor: Antichain codes. Designs, Codes and Cryptography (to appear)

    Google Scholar 

  2. J.H. Conway, V. Pless and N. J. A. Sloane: Self-Dual Codes over GF(3) and GF(4) of Length not Exceeding 16. IEEE Trans. Inform. Theory 25 (1979) 312–316

    Article  MATH  MathSciNet  Google Scholar 

  3. S. Encheva: On binary linear codes which satisfy the two-way chain condition. IEEE Trans. Inform. Theory Theory 42 (1996) 1038–1047

    Article  MATH  MathSciNet  Google Scholar 

  4. S. Encheva: On repeated-root cyclic codes and the two-way chain condition. Springer-Verlag LNCS 1255 (1997)

    Google Scholar 

  5. G. D. Forney, Jr.: Density/Length Profiles and Trellis Complexity of Lattices. IEEE Trans. Inform. Theory 40 (1994) 1753–1772

    Article  MATH  MathSciNet  Google Scholar 

  6. P.A. Franaszek: Sequence-state coding for digital transmission. Bell Syst. Tech. J. 47 (1968) 143–157

    Google Scholar 

  7. T. Kasami, T. Takata, T. Fujkiwara and S. Lin: On the optimum bit orders with respect to the state complexity oftre llis diagrams for binary linear codes.IEEE Trans. Inform. Theory 39 (1993) 242–245

    Article  MATH  MathSciNet  Google Scholar 

  8. F. J. MacWilliams and N. J. A. Sloane: The Theory ofE rror-Correcting codes. North-Holland Amsterdam (1977)

    Google Scholar 

  9. C. L. Mallows, V. Pless and N. J. A. Sloane: Self-Dual Codes over GF(3) SIAM J. Appl. Math. 31 (1976) 649–666

    MATH  MathSciNet  Google Scholar 

  10. V. Pless, N. J. A. Sloane and H. N. Ward: Ternary codes ofM inimum Weight 6 and the Classification ofth e Self-Dual Codes of Length 20 IEEE Trans. Inform. Theory 26 (1980) 305–316

    Article  MATH  MathSciNet  Google Scholar 

  11. N.J.A. Sloane: Self-dual codes and lattices. In Relations between Combinatorics and other Parts ofMath ematics Amer. Math. Soc. Proc. Sympos. Pure Math. vol. XXXIV (1979) 273–308

    MathSciNet  Google Scholar 

  12. A. Vardy: Trellis Structure of Codes. In Handbook of Coding Theory II. Elsevier (1998) 1989–2117

    Google Scholar 

  13. V. K. Wei and K. Yang: On the generalized Hamming weights of product codes. IEEE Trans. Inform. Theory 39 (1993) 1709–1713

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Stord/Haugesund College, Bj∅rnsonsgt. 45, 5528, Haugesund, Norway

    Sylvia Encheva

  2. ENST, Dept. of Informatics and CNRS, 46 rue Barrault, 75634, Paris, Cedex 13, France

    Gérard Cohen

Authors
  1. Sylvia Encheva
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gérard Cohen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering, University of Hawaii, 2540 Dole St., # 483, Honolulu, HI, 96822, USA

    Marc Fossorier  & Shu Lin  & 

  2. Institute of Industrial Science, University of Tokyo, 7-22-1, Roppongi, Minato-ku, Tokyo, 106, Japan

    Hideki Imai

  3. AAECC/IRIT, Université Paul Sabatier, 118, Route de Narbonne, F31067, Toulouse, Cedex, France

    Alain Poli

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Encheva, S., Cohen, G. (1999). On the State Complexities of Ternary Codes. In: Fossorier, M., Imai, H., Lin, S., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1999. Lecture Notes in Computer Science, vol 1719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46796-3_43

Download citation

  • DOI: https://doi.org/10.1007/3-540-46796-3_43

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66723-0

  • Online ISBN: 978-3-540-46796-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation