Skip to main content
Log in

Three-weight codes and near-bent functions from two-weight codes

  • Original Paper
  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

We introduce a construction of binary 3-weight codes and near-bent functions from 2-weight projective codes.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Canteaut, A., Charpin, P.: Decomposing bent functions. IEEE Trans. Inf. Theory. 49(8), 2004–2019 (2003)

    Article  MathSciNet  Google Scholar 

  2. Baumert, D., McEliece, R.J.: Weights of irreducible cyclic codes. Inf. Control 20, 158–175 (1972)

    Article  MathSciNet  Google Scholar 

  3. Delsarte, P.: Weights of linear codes and strongly regular normed spaces. Discrete Math. 3, 47–64 (1972)

    Article  MathSciNet  Google Scholar 

  4. Dillon, J.F.: Elementary Hadamard difference sets. Ph.D. thesis, University of Maryland (1974)

  5. Ding, C., Li, C., Li, N., Zhou, Z.C.: Three-weight cyclic codes and their weight distributions. Discrete Math. 339, 415–427 (2016)

    Article  MathSciNet  Google Scholar 

  6. Leander, G., McGuire, G.: Construction of bent functions from near-bent functions. J. Comb. Theory Ser. A 116(4), 960–970 (2009)

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  8. Pless, V.: Power moment identities on weight distribution in error correcting codes. Inf. Control 6, 147–152 (1963)

    Article  MathSciNet  Google Scholar 

  9. Pless, V., Huffman, W.C. (eds.): Handbook of Coding Theory. Elsevier, Amsterdam (1998)

  10. Rothaus, O.S.: On bent functions. J. Comb. Theory Ser. A 20, 300–305 (1976)

    Article  Google Scholar 

  11. Tang, C., Li, N., Qi, Y.F., Zhou, Z.C., Helleseth, T.: Linear codes with two or three weights from weakly regular bent functions. IEEE Trans. Inf. Theory 62(3), 1166–1176 (2016)

    Article  MathSciNet  Google Scholar 

  12. Wolfmann, J.: Bent functions and coding theory. In: Pott, A., Kumar, P.V., Helleseth, T., Jungnickel, D. (eds.) Difference Sets, Sequences and Their Correlation Properties, NATO Sciences Series, Series C, vol. 542, pp. 393–418. Kluwer, Dordrecht (1999)

    Google Scholar 

  13. Wolfmann, J.: Are 2-weight projective cyclic codes irreducible? IEEE Trans. Inf. Theory 51(2), 733–737 (2005)

    Article  MathSciNet  Google Scholar 

  14. Wolfmann, J.: Cyclic code aspects of bent functions. In: Finite Fields: Theory and Applications, AMS Series “Contemporary Mathematics”. vol. 518, pp. 363–384 (2010)

  15. Wolfmann, J.: Special bent and near-bent functions. Adv. Math. Commun. 8(1), 21–33 (2014)

    Article  MathSciNet  Google Scholar 

  16. Wolfmann, J.: From near-bent to bent: a special case. In: Topics in Finite Fields, AMS Series “Contemporary Mathematics” vol. 632, pp. 359–371 (2015)

  17. Wolfmann, J.: Codes Projectifs à deux poids, Caps complets et Ensembles de Différences. J. Comb. Theory Ser. A 23, 208–222 (1977)

    Article  Google Scholar 

  18. Zhang, D., Fan, C., Peng, D., Tang, X.: Complete weight enumerators of some linear codes from quadratic forms. Cryptogr. Commun. 9(1), 151–163 (2017)

    Article  MathSciNet  Google Scholar 

  19. Zhou, Z., Li, N., Fan, C., Helleseth, T.: Linear code with two or three weights from quadratic bent functions. Des. Codes Cryptogr. 81(2), 283–295 (2016)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to J. Wolfmann.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wolfmann, J. Three-weight codes and near-bent functions from two-weight codes. AAECC 29, 513–528 (2018). https://doi.org/10.1007/s00200-018-0354-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-018-0354-2

Keywords

Navigation