Skip to main content
SpringerLink
Log in

On Binary/Ternary Error-Correcting Codes with Minimum Distance 4

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

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

Abstract

We consider error-correcting codes over mixed alphabets with n 2 binary and n 3 ternary coordinates, and denote the maximum cardinality of such a code with minimum distance d by N(n 2,n 3,d). We here study this function for short codes (n 2+3 ≤13) and d = 4.A computeraided method is used to settle 14 values, and bounds for 34 other entries are improved. In the method used, codes are built up from smaller codes using backtracking and isomorphism rejection. Codes of short length are further classified.

The research was supported by the Academy of Finland.

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. Brouwer, A.E., Hämäläinen, H.O., Östergård, P.R.J., Sloane, N.J.A.: Boundson mixed binary/ternary codes.IEEE Trans. Inform. Theory 44 (1998) 140–161

    Article  MATH  MathSciNet  Google Scholar 

  2. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, New York (1979)

    MATH  Google Scholar 

  3. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)

    Google Scholar 

  4. McKay, B.D.: nauty user’s guide (version 1.5). Tech. Rep. TR-CS-90-02, Computer Science Department, Australian National University (1990)

    Google Scholar 

  5. McKay, B.D.: autoson-a distributed batch system for UNIX workstation networks (version 1.3). Tech. Rep. TR-CS-96-03, Computer Science Department, Australian National University (1996)

    Google Scholar 

  6. Östergård, P.R.J.: Classification of small binary/ternary one-error-correcting codes. (submitted for publication)

    Google Scholar 

  7. Östergård, P.R.J., Baicheva, T., Kolev, E.: Optimal binary one-error-correcting codes of length 10 have 72 codewords. IEEE Trans. Inform. Theory 45 (1999) 1229–1231

    Article  MATH  MathSciNet  Google Scholar 

  8. Vaessens, R.J.M., Aarts, E.H.L., van Lint, J.H.: Genetic algorithms in coding theory—a table for A3(n, d). Discrete Appl. Math. 45 (1993) 71–87

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Helsinki University of Technology, 5400, 02015 HUT, Finland

    Patric R. J. Östergård

Authors
  1. Patric R. J. Östergård
    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

Östergård, P.R.J. (1999). On Binary/Ternary Error-Correcting Codes with Minimum Distance 4. 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_45

Download citation

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

  • 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