Skip to main content

On Duals of Binary Primitive BCH Codes

  • Chapter
Eurocode ’92

Part of the book series: International Centre for Mechanical Sciences ((CISM,volume 339))

  • 103 Accesses

Abstract

We treat binary extended cyclic codes of length 2m over F2. We introduce a class, denoted by {C (t)}2≤t≤m−1, of such codes, whose defining set is characterized by only one cyclotomic coset. We prove that they are duals of extended BCH codes. We study the divisibility of the C (t)’s, and show that it determines the divisibility of all duals of extended BCH codes. Next we obtain a lower bound on their minimum distance, that yields results for several affine-invariant codes. In particular, it gives a bound for all duals of extended BCH codes, which is interesting especially when the Carlitz-Uchiyama bound is negative.

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 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. Carlitz L., Uchiyama S.: Bounds for exponential sums, Duke Math. Journal 24, pp. 37–41, 1957.

    MATH  MathSciNet  Google Scholar 

  2. Charpin P.: Codes cycliques étendus affine-invariants et antichaines d’un ensemble partiellement ordonné. Discrete Mathematics 80, North-Holland, 1990, p. 229–247.

    Google Scholar 

  3. Charpin P.: Some applications of a classification of affine-invariant codes. Lect. Notes in Comp. Sci.356, Proceedings of AAECC 5, Springer-Verlag 1987.

    Google Scholar 

  4. Kasami T., Lin S., Peterson W.W.: Some results on cyclic codes which are invariant under the affine group and their applications. Info. and Control, vol 11, p. 475–496, 1967.

    Article  MATH  MathSciNet  Google Scholar 

  5. Kasami T., Tokura N.:On the weight structure of Reed Muller codes. IEEE Trans. on Inf. theory, vol IT 16, no 6, nov. 1970, p. 752–759.

    Google Scholar 

  6. Le] Levy-dit-Vehel F.: On duals of primitive binary BCH codes. INRIA Report, to appear.

    Google Scholar 

  7. Li,Mo] Litsyn S., Moreno C.J., Moreno O.: Divisibility properties and new bounds for cyclic codes and exponential sums in one and several variables, preprint.

    Google Scholar 

  8. Mann H.B.: On the number of information symbols in Bose-Chauduri codes. Information and control 5, 1962, p. 153–162.

    Article  MATH  MathSciNet  Google Scholar 

  9. Mc Eliece R.J.: Weight congruences for p-ary cyclic codes. Discrete Math. 3, 1972, p. 177–192.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Wien

About this chapter

Cite this chapter

Levy-dit-Vehel, F. (1993). On Duals of Binary Primitive BCH Codes. In: Camion, P., Charpin, P., Harari, S. (eds) Eurocode ’92. International Centre for Mechanical Sciences, vol 339. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2786-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-2786-5_5

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-82519-8

  • Online ISBN: 978-3-7091-2786-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics