Skip to main content
SpringerLink
Log in

One-weight Z4-linear Codes

  • Conference paper
Coding Theory, Cryptography and Related Areas

Abstract

We show that, for every ordered pair of nonnegative integers (k 1, k 2), there exists a unique (up to equivalence) one-weight Z4-linear code of type 4k 12k 2. We derive an upper bound and a lower bound on the highest minimum distance between some extended one-weight Z4-linear codes and the Reed-Muller codes of order 1 and same lengths.

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

References

  1. A.S. Ambrosimov Properties of bent functions of q-valued logic over finite fields Discrete Math. Appl. vol 4, n° 4, p. 341–350 (1994)

    Google Scholar 

  2. A. Bonnecaze and I. Duursma, Translates of Z4-linear codes, IEEE Trans. on Inf. Theory., vol. 43, p. 1218–1230 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  3. C. Carlet. Z2k-linear codes, IEEE Trans. Inform. Theory vol. 44, n° 4, p. 1543–1547 (1998).

    MathSciNet  Google Scholar 

  4. C. Carlet, P. Charpin and V. Zinoviev. Codes, bent functions and permutations suitable for DES-like cryptosystems, Designs Codes and Cryptography, to appear (1998)

    Google Scholar 

  5. F. Chabaud and S. Vaudenay, Links between differential and linear cryptanalysis In Advances in Cryptology EUROCRYPT’94, Perugia, Italy, Lecture Notes in Computer Science No. 950, p. 356–365, Springer-Verlag, 1995.

    Google Scholar 

  6. J. F. Dillon, Elementary Hadamard Difference sets, Ph. D. Thesis, Univ. of Maryland (1974).

    Google Scholar 

  7. H. Dobbertin, Construction of bent functions and balanced Boolean functions with high nonlinearity, Fast Software Encryption (Proceedings of the 1994 Leuven Workshop on Cryptographic Algorithms), Lecture Notes in Computer Science 1008, p. 61–74 (1995).

    Article  Google Scholar 

  8. A. R. Hammons Jr., P. V. Kumar, A. R. Calderbank, N. J. A. Sloane and P. Solé, The Z4 -linearity of Kerdock, Preparata, Goethals and related codes IEEE Transactions on Information Theory, vol 40, p. 301–320, (1994)

    Article  MATH  Google Scholar 

  9. Tor Helleseth, P. V. Kumar, Oscar Moreno and A.G. Shanbhag Improved estimates via exponential sums for the minimum distance of Z4-linear trace codes IEEE Transactions on Information Theory, vol 42, p. 1212–1216, (1996)

    MathSciNet  MATH  Google Scholar 

  10. P. V. Kumar, T. Helleseth and A. R. Calderbank An upper bound for Weil exponential sums over Galois rings and applications IEEE Transactions on Information Theory, vol 41, p. 456–468, (1995)

    Article  MathSciNet  MATH  Google Scholar 

  11. O. A. Logachev, A. A. Salnikov and V. V. Yashchenko Bent functions on a finite abelian group, Discrete Math. Appl., Vol. 7, p. 547–564 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  12. B.R. MacDonald„ Finite rings with identity, Marcel Dekker, NY, 1974

    Google Scholar 

  13. M. Matsui, Linear cryptanalysis method for DES cipher, EUROCRYPT’93 Advances in Cryptography, Lecture Notes in Computer Science 765, p. 386–397 (1994).

    Article  Google Scholar 

  14. Y. Niho, Multi-valued cross-correlation functions between two maximal linear recursive sequences, Ph. D. Thesis, USCEE Rep. 409 (1972).

    Google Scholar 

  15. K. Nyberg, Perfect non-linear S-boxes, Advances in Cryptology, EUROCRYPT’ 91, Lecture Notes in Computer Science 547, p. 378–386, Springer Verlag (1992)

    Google Scholar 

  16. W. W. Peterson, Error-correcting codes, Amsterdam, North Holland 1977.

    Google Scholar 

  17. R. A. Rueppel Analysis and design of stream ciphers Corn. and Contr. Eng. Series, Berlin, Heidelberg, NY, London, Paris, Tokyo 1986

    Google Scholar 

  18. V. M. Sidelnikov, On the mutual correlation of sequences, Soviet Math. Dokl. 12, p. 197–201 (1971).

    Google Scholar 

  19. F. J. Mac Williams and N. J. Sloane, The theory of error-correcting codes, MIT Press, Cambridge, MA 1961.

    Google Scholar 

  20. P. Shankar, On BCH codes over arbitrary integer rings, IEEE Trans. on Inf. Theory, vol. 25, p. 480–483 (1979).

    Article  MathSciNet  MATH  Google Scholar 

  21. K. Yang, T. Helleseth, P. V. Kumar and A. G Shanbhag, On the weight hierarchy of Kerdock codes over Z4, IEEE Trans. on Inf. Theory, vol. 42, p. 1587–1593 (1996).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA Projet CODES, BP 105, 78153, Le Chesnay Cedex, France

    Claude Carlet

  2. GREYC, Université de Caen, France

    Claude Carlet

Authors
  1. Claude Carlet
    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

Carlet, C. (2000). One-weight Z4-linear Codes. 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_5

Download citation

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

  • 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