×

Three-weight codes and near-bent functions from two-weight codes. (English) Zbl 1417.94109

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

MSC:

94B05 Linear codes (general theory)
Full Text: DOI

References:

[1] Canteaut, A.; Charpin, P., Decomposing bent functions, IEEE Trans. Inf. Theory., 49, 2004-2019, (2003) · Zbl 1184.94230 · doi:10.1109/TIT.2003.814476
[2] Baumert, D.; McEliece, RJ, Weights of irreducible cyclic codes, Inf. Control, 20, 158-175, (1972) · Zbl 0239.94007 · doi:10.1016/S0019-9958(72)90354-3
[3] Delsarte, P., Weights of linear codes and strongly regular normed spaces, Discrete Math., 3, 47-64, (1972) · Zbl 0245.94010 · doi:10.1016/0012-365X(72)90024-6
[4] Dillon, J.F.: Elementary Hadamard difference sets. Ph.D. thesis, University of Maryland (1974) · Zbl 0346.05003
[5] Ding, C.; Li, C.; Li, N.; Zhou, ZC, Three-weight cyclic codes and their weight distributions, Discrete Math., 339, 415-427, (2016) · Zbl 1356.94094 · doi:10.1016/j.disc.2015.09.001
[6] Leander, G.; McGuire, G., Construction of bent functions from near-bent functions, J. Comb. Theory Ser. A, 116, 960-970, (2009) · Zbl 1184.94240 · doi:10.1016/j.jcta.2008.12.004
[7] Mac Williams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North-Holland, Amsterdam (1977) · Zbl 0369.94008
[8] Pless, V., Power moment identities on weight distribution in error correcting codes, Inf. Control, 6, 147-152, (1963) · Zbl 0149.37905 · doi:10.1016/S0019-9958(63)90189-X
[9] Pless, V., Huffman, W.C. (eds.): Handbook of Coding Theory. Elsevier, Amsterdam (1998) · Zbl 0907.94001
[10] Rothaus, OS, On bent functions, J. Comb. Theory Ser. A, 20, 300-305, (1976) · Zbl 0336.12012 · doi:10.1016/0097-3165(76)90024-8
[11] Tang, C.; Li, N.; Qi, YF; Zhou, ZC; Helleseth, T., Linear codes with two or three weights from weakly regular bent functions, IEEE Trans. Inf. Theory, 62, 1166-1176, (2016) · Zbl 1359.94738 · doi:10.1109/TIT.2016.2518678
[12] Wolfmann, J.; Pott, A. (ed.); Kumar, PV (ed.); Helleseth, T. (ed.); Jungnickel, D. (ed.), Bent functions and coding theory, No. 542, 393-418, (1999), Dordrecht · Zbl 0972.94023
[13] Wolfmann, J., Are 2-weight projective cyclic codes irreducible?, IEEE Trans. Inf. Theory, 51, 733-737, (2005) · Zbl 1307.94127 · doi:10.1109/TIT.2004.840882
[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) · Zbl 1211.94048
[15] Wolfmann, J., Special bent and near-bent functions, Adv. Math. Commun., 8, 21-33, (2014) · Zbl 1287.11140 · doi:10.3934/amc.2014.8.21
[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) · Zbl 1407.94161
[17] Wolfmann, J., Codes Projectifs à deux poids, Caps complets et Ensembles de Différences, J. Comb. Theory Ser. A, 23, 208-222, (1977) · Zbl 0364.94020 · doi:10.1016/0097-3165(77)90042-5
[18] Zhang, D.; Fan, C.; Peng, D.; Tang, X., Complete weight enumerators of some linear codes from quadratic forms, Cryptogr. Commun., 9, 151-163, (2017) · Zbl 1416.94071 · doi:10.1007/s12095-016-0190-9
[19] Zhou, Z.; Li, N.; Fan, C.; Helleseth, T., Linear code with two or three weights from quadratic bent functions, Des. Codes Cryptogr., 81, 283-295, (2016) · Zbl 1405.94116 · doi:10.1007/s10623-015-0144-9
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.