-
Previous Article
Two classes of cyclic extended double-error-correcting Goppa codes
- AMC Home
- This Issue
-
Next Article
A coercion-resistant blockchain-based E-voting protocol with receipts
Online First articles are published articles within a journal that have not yet been assigned to a formal issue. This means they do not yet have a volume number, issue number, or page numbers assigned to them, however, they can still be found and cited using their DOI (Digital Object Identifier). Online First publication benefits the research community by making new scientific discoveries known as quickly as possible.
Readers can access Online First articles via the “Online First” tab for the selected journal.
Nearly optimal codebooks from generalized Boolean bent functions over $ \mathbb{Z}_{4} $
1. | Hubei Key Laboratory of Applied Mathematics, Faculty of Mathematics and Statistics, Hubei University, Wuhan, 430062, China |
2. | Faculty of Mathematics and Statistics, Hubei Engineering University, Xiaogan, 432000, China |
In this paper, based on the theory of $ \mathbb{Z}_{4} $-valued quadratic forms we propose several classes of generalized Boolean bent functions over $ \mathbb{Z}_{4} $, and new families of codebooks are constructed from these functions. The codebooks constructed in this paper are nearly optimal with respect to the Welch bound, and their parameters are new. Furthermore, some Boolean bent functions are also derived.
References:
[1] |
E. H. Brown,
Generalizations of the Kervaire invariant, Annals. Math., 95 (1972), 368-383.
doi: 10.2307/1970804. |
[2] |
X. Cao, W. Chou and X. Zhang,
More constructions of near optimal codebooks associated with binary sequences, Adv. Math. Commun., 11 (2017), 187-202.
doi: 10.3934/amc.2017012. |
[3] |
C. Carlet and S. Mesnager,
Four decades of research on bent functions, Des. Codes Cryptogr., 78 (2016), 5-50.
doi: 10.1007/s10623-015-0145-8. |
[4] |
P. Charpin, E. Pasalic and C. Tavernier,
On bent and semi-bent quadratic Boolean functions, IEEE Trans. Inf. Theory, 51 (2005), 4286-4298.
doi: 10.1109/TIT.2005.858929. |
[5] |
C. Ding,
Complex codebooks from combinatorial designs, IEEE Trans. Inf. Theory, 52 (2006), 4229-4235.
doi: 10.1109/TIT.2006.880058. |
[6] |
C. Ding and T. Feng,
A generic construction of complex codebooks meeting the Welch bound, IEEE Trans. Inf. Theory, 53 (2007), 4245-4250.
doi: 10.1109/TIT.2007.907343. |
[7] |
C. Ding and T. Feng,
Codebooks from almost difference sets, Des. Codes Cryptogr., 46 (2008), 113-126.
doi: 10.1007/s10623-007-9140-z. |
[8] |
C. Ding and J. Yin,
Signal sets from functions with optimimum nonlinearity, IEEE Trans. Communications, 55 (2007), 936-940.
doi: 10.1109/TCOMM.2007.894113. |
[9] |
A. R. Hammons, P. V. Kumar, A. R. Calderbank, N. J. A. Sloane and P. Sole,
The ${\mathbb Z}_4$-linearity of Kerdock, Preparata, Goethals, and related codes, IEEE Trans. Inf. Theory, 40 (1994), 301-319.
doi: 10.1109/18.312154. |
[10] |
Z. Heng,
Nearly optimal codebooks based on generalized Jacobi sums, Dis. Appli. Math., 250 (2018), 227-240.
doi: 10.1016/j.dam.2018.05.017. |
[11] |
Z. Heng, C. Ding and Q. Yue,
New constructions of asymptotically optimal codebooks with multiplicative characters, IEEE Trans. Inf. Theory, 63 (2017), 6179-6187.
doi: 10.1109/TIT.2017.2693204. |
[12] |
Z. Heng and Q. Yue,
Optimal codebooks achieving the Levenshtein bound from generalized bent functions over $\mathbb{Z}_4$, Cryptogr. Commun., 9 (2017), 41-53.
doi: 10.1007/s12095-016-0194-5. |
[13] |
S. Hong, H. Park, T. Helleseth and Y. Kim,
Near-optimal partial Hadamard codebook construction using binary sequences obtained from quadratic residue mapping, IEEE Trans. Inf. Theory, 60 (2014), 3698-3705.
doi: 10.1109/TIT.2014.2314298. |
[14] |
H. Hu and J. Wu,
New constructions of codebooks nearly meeting the Welch bound with equality, IEEE Trans. Inf. Theory, 60 (2014), 1348-1355.
doi: 10.1109/TIT.2013.2292745. |
[15] |
V. I. Levenshtein,
Bounds for packing of metric spaces and some of their applications, Probl. Cybern., 40 (1983), 43-110.
|
[16] |
C. Li, Q. Yue and Y. Huang,
Two families of nearly optimal codebooks, Des. Codes Cryptogr., 75 (2015), 43-57.
doi: 10.1007/s10623-013-9891-7. |
[17] |
N. Li, X. Tang and T. Helleseth,
New constructions of quadratic bent functions in polynomial form, IEEE Trans. Inf. Theory, 60 (2014), 5760-5767.
doi: 10.1109/TIT.2014.2339861. |
[18] |
R. Lidl and H. Niederreiter, Finite Fields, Encyclopedia of Mathematics and Its Applications, Cambridge University Press, Cambridge, England, 1997. |
[19] |
W. Lu, X. Wu, X. Cao and M. Chen, Six constructions of asymptotically optimal codebooks via the character sums, Des. Codes Cryptogr., 88 (2020), 1139-1158.
doi: 10.1007/s10623-020-00735-w. |
[20] |
G. Luo and X. Cao,
Two constructions of asymptotically optimal codebooks via the hyper Eisenstein sum, IEEE Trans. Inf. Theory, 64 (2018), 6498-6505.
doi: 10.1109/TIT.2017.2777492. |
[21] |
G. Luo and X. Cao, New constructions of codebooks asymptotically achieving the Welch bound, 2018 IEEE International Symposium on Information Theory, (2018), 2346–2350. |
[22] |
S. Mesnager, Bent Functions: Fundamentals and Results, Springer-Verlag, 2016.
doi: 10.1007/978-3-319-32595-8. |
[23] |
Y. Qi, S. Mesnager, C. Tang, Codebooks from generalized bent $\mathbb{Z}_{4}$-valued quadratic forms, Discret. Math., 343 (2020), 111736.
doi: 10.1016/j.disc.2019.111736. |
[24] |
L. Qian, X. Cao, W. Lu and X. Wu, New constructions of asymptotically optimal codebooks via character sums over a local ring, preprint, arXiv: 1906.05523. |
[25] |
O. S. Rothaus,
On "bent" functions, J. Combin. Theory Ser. A, 20 (1976), 300-305.
doi: 10.1016/0097-3165(76)90024-8. |
[26] |
D. V. Sarwate, Meeting the Welch bound with equality, Sequences and Their Applications, Springer London, 1999, 79–102. |
[27] |
K. Schmidt,
${\mathbb Z}_4$-valued quadratic forms and quaternary sequence families, IEEE Trans. Inf. Theory, 55 (2009), 5803-5810.
doi: 10.1109/TIT.2009.2032818. |
[28] |
P. Sol$\acute{e}$ and N. Tokareva, Connections between quaternary and binary bent functions, 2009. Available from: https://eprint.iacr.org/2009/544.pdf. |
[29] |
P. Tan, Z. Zhou and D. Zhang,
A construction of codebooks nearly achieving the Levenshtein bound, IEEE Signal Process. Lett., 23 (2016), 1306-1309.
doi: 10.1109/LSP.2016.2595106. |
[30] |
L. Welch,
Lower bounds on the maximum cross correlation of signal, IEEE Trans. Inf. Theory, 20 (1974), 397-399.
doi: 10.1109/TIT.1974.1055219. |
[31] |
X. Wu, W. Lu and X. Cao,
Two constructions of asymptotically optimal codebooks via the trace functions, Cryptogr. Commun., 12 (2020), 1195-1211.
doi: 10.1007/s12095-020-00448-w. |
[32] |
P. Xia, S. Zhou and G. B. Giannakis,
Achieving the Welch bound with difference sets, IEEE Trans. Inf. Theory, 51 (2005), 1900-1907.
doi: 10.1109/TIT.2005.846411. |
[33] |
C. Xiang, C. Ding and S. Mesnager,
Optimal codebooks from binary codes meeting the Levenshtein bound, IEEE Trans. Inf. Theory, 61 (2015), 6526-6535.
doi: 10.1109/TIT.2015.2487451. |
[34] |
W. Yin, C. Xiang and F. Fu,
A further construction of asymptotically optimal codebooks with multiplicative characters, Appl. Algebra Eng. Commun. Comput., 30 (2019), 453-469.
doi: 10.1007/s00200-019-00387-x. |
[35] |
N. Y. Yu,
A construction of codebooks associated with binary sequences, IEEE Trans. Inf. Theory, 58 (2012), 5522-5533.
doi: 10.1109/TIT.2012.2196021. |
[36] |
A. Zhang and K. Feng,
Two classes of codebooks nearly meeting the Welch bound, IEEE Trans. Inf. Theory, 58 (2012), 2507-2511.
doi: 10.1109/TIT.2011.2176531. |
[37] |
A. Zhang and K. Feng,
Construction of cyclotomic codebooks nearly meeting the Welch bound, Des. Codes Cryptogr., 63 (2012), 209-224.
doi: 10.1007/s10623-011-9549-2. |
[38] |
Z. Zhou, C. Ding and N. Li,
New families of codebooks achieving the Levenshtein bound, IEEE Trans. Inf. Theory, 60 (2014), 7382-7387.
doi: 10.1109/TIT.2014.2353052. |
[39] |
Z. Zhou and X. Tang,
New nearly optimal codebooks from relative difference sets, Adv. Math. Commun., 5 (2011), 521-527.
doi: 10.3934/amc.2011.5.521. |
show all references
References:
[1] |
E. H. Brown,
Generalizations of the Kervaire invariant, Annals. Math., 95 (1972), 368-383.
doi: 10.2307/1970804. |
[2] |
X. Cao, W. Chou and X. Zhang,
More constructions of near optimal codebooks associated with binary sequences, Adv. Math. Commun., 11 (2017), 187-202.
doi: 10.3934/amc.2017012. |
[3] |
C. Carlet and S. Mesnager,
Four decades of research on bent functions, Des. Codes Cryptogr., 78 (2016), 5-50.
doi: 10.1007/s10623-015-0145-8. |
[4] |
P. Charpin, E. Pasalic and C. Tavernier,
On bent and semi-bent quadratic Boolean functions, IEEE Trans. Inf. Theory, 51 (2005), 4286-4298.
doi: 10.1109/TIT.2005.858929. |
[5] |
C. Ding,
Complex codebooks from combinatorial designs, IEEE Trans. Inf. Theory, 52 (2006), 4229-4235.
doi: 10.1109/TIT.2006.880058. |
[6] |
C. Ding and T. Feng,
A generic construction of complex codebooks meeting the Welch bound, IEEE Trans. Inf. Theory, 53 (2007), 4245-4250.
doi: 10.1109/TIT.2007.907343. |
[7] |
C. Ding and T. Feng,
Codebooks from almost difference sets, Des. Codes Cryptogr., 46 (2008), 113-126.
doi: 10.1007/s10623-007-9140-z. |
[8] |
C. Ding and J. Yin,
Signal sets from functions with optimimum nonlinearity, IEEE Trans. Communications, 55 (2007), 936-940.
doi: 10.1109/TCOMM.2007.894113. |
[9] |
A. R. Hammons, P. V. Kumar, A. R. Calderbank, N. J. A. Sloane and P. Sole,
The ${\mathbb Z}_4$-linearity of Kerdock, Preparata, Goethals, and related codes, IEEE Trans. Inf. Theory, 40 (1994), 301-319.
doi: 10.1109/18.312154. |
[10] |
Z. Heng,
Nearly optimal codebooks based on generalized Jacobi sums, Dis. Appli. Math., 250 (2018), 227-240.
doi: 10.1016/j.dam.2018.05.017. |
[11] |
Z. Heng, C. Ding and Q. Yue,
New constructions of asymptotically optimal codebooks with multiplicative characters, IEEE Trans. Inf. Theory, 63 (2017), 6179-6187.
doi: 10.1109/TIT.2017.2693204. |
[12] |
Z. Heng and Q. Yue,
Optimal codebooks achieving the Levenshtein bound from generalized bent functions over $\mathbb{Z}_4$, Cryptogr. Commun., 9 (2017), 41-53.
doi: 10.1007/s12095-016-0194-5. |
[13] |
S. Hong, H. Park, T. Helleseth and Y. Kim,
Near-optimal partial Hadamard codebook construction using binary sequences obtained from quadratic residue mapping, IEEE Trans. Inf. Theory, 60 (2014), 3698-3705.
doi: 10.1109/TIT.2014.2314298. |
[14] |
H. Hu and J. Wu,
New constructions of codebooks nearly meeting the Welch bound with equality, IEEE Trans. Inf. Theory, 60 (2014), 1348-1355.
doi: 10.1109/TIT.2013.2292745. |
[15] |
V. I. Levenshtein,
Bounds for packing of metric spaces and some of their applications, Probl. Cybern., 40 (1983), 43-110.
|
[16] |
C. Li, Q. Yue and Y. Huang,
Two families of nearly optimal codebooks, Des. Codes Cryptogr., 75 (2015), 43-57.
doi: 10.1007/s10623-013-9891-7. |
[17] |
N. Li, X. Tang and T. Helleseth,
New constructions of quadratic bent functions in polynomial form, IEEE Trans. Inf. Theory, 60 (2014), 5760-5767.
doi: 10.1109/TIT.2014.2339861. |
[18] |
R. Lidl and H. Niederreiter, Finite Fields, Encyclopedia of Mathematics and Its Applications, Cambridge University Press, Cambridge, England, 1997. |
[19] |
W. Lu, X. Wu, X. Cao and M. Chen, Six constructions of asymptotically optimal codebooks via the character sums, Des. Codes Cryptogr., 88 (2020), 1139-1158.
doi: 10.1007/s10623-020-00735-w. |
[20] |
G. Luo and X. Cao,
Two constructions of asymptotically optimal codebooks via the hyper Eisenstein sum, IEEE Trans. Inf. Theory, 64 (2018), 6498-6505.
doi: 10.1109/TIT.2017.2777492. |
[21] |
G. Luo and X. Cao, New constructions of codebooks asymptotically achieving the Welch bound, 2018 IEEE International Symposium on Information Theory, (2018), 2346–2350. |
[22] |
S. Mesnager, Bent Functions: Fundamentals and Results, Springer-Verlag, 2016.
doi: 10.1007/978-3-319-32595-8. |
[23] |
Y. Qi, S. Mesnager, C. Tang, Codebooks from generalized bent $\mathbb{Z}_{4}$-valued quadratic forms, Discret. Math., 343 (2020), 111736.
doi: 10.1016/j.disc.2019.111736. |
[24] |
L. Qian, X. Cao, W. Lu and X. Wu, New constructions of asymptotically optimal codebooks via character sums over a local ring, preprint, arXiv: 1906.05523. |
[25] |
O. S. Rothaus,
On "bent" functions, J. Combin. Theory Ser. A, 20 (1976), 300-305.
doi: 10.1016/0097-3165(76)90024-8. |
[26] |
D. V. Sarwate, Meeting the Welch bound with equality, Sequences and Their Applications, Springer London, 1999, 79–102. |
[27] |
K. Schmidt,
${\mathbb Z}_4$-valued quadratic forms and quaternary sequence families, IEEE Trans. Inf. Theory, 55 (2009), 5803-5810.
doi: 10.1109/TIT.2009.2032818. |
[28] |
P. Sol$\acute{e}$ and N. Tokareva, Connections between quaternary and binary bent functions, 2009. Available from: https://eprint.iacr.org/2009/544.pdf. |
[29] |
P. Tan, Z. Zhou and D. Zhang,
A construction of codebooks nearly achieving the Levenshtein bound, IEEE Signal Process. Lett., 23 (2016), 1306-1309.
doi: 10.1109/LSP.2016.2595106. |
[30] |
L. Welch,
Lower bounds on the maximum cross correlation of signal, IEEE Trans. Inf. Theory, 20 (1974), 397-399.
doi: 10.1109/TIT.1974.1055219. |
[31] |
X. Wu, W. Lu and X. Cao,
Two constructions of asymptotically optimal codebooks via the trace functions, Cryptogr. Commun., 12 (2020), 1195-1211.
doi: 10.1007/s12095-020-00448-w. |
[32] |
P. Xia, S. Zhou and G. B. Giannakis,
Achieving the Welch bound with difference sets, IEEE Trans. Inf. Theory, 51 (2005), 1900-1907.
doi: 10.1109/TIT.2005.846411. |
[33] |
C. Xiang, C. Ding and S. Mesnager,
Optimal codebooks from binary codes meeting the Levenshtein bound, IEEE Trans. Inf. Theory, 61 (2015), 6526-6535.
doi: 10.1109/TIT.2015.2487451. |
[34] |
W. Yin, C. Xiang and F. Fu,
A further construction of asymptotically optimal codebooks with multiplicative characters, Appl. Algebra Eng. Commun. Comput., 30 (2019), 453-469.
doi: 10.1007/s00200-019-00387-x. |
[35] |
N. Y. Yu,
A construction of codebooks associated with binary sequences, IEEE Trans. Inf. Theory, 58 (2012), 5522-5533.
doi: 10.1109/TIT.2012.2196021. |
[36] |
A. Zhang and K. Feng,
Two classes of codebooks nearly meeting the Welch bound, IEEE Trans. Inf. Theory, 58 (2012), 2507-2511.
doi: 10.1109/TIT.2011.2176531. |
[37] |
A. Zhang and K. Feng,
Construction of cyclotomic codebooks nearly meeting the Welch bound, Des. Codes Cryptogr., 63 (2012), 209-224.
doi: 10.1007/s10623-011-9549-2. |
[38] |
Z. Zhou, C. Ding and N. Li,
New families of codebooks achieving the Levenshtein bound, IEEE Trans. Inf. Theory, 60 (2014), 7382-7387.
doi: 10.1109/TIT.2014.2353052. |
[39] |
Z. Zhou and X. Tang,
New nearly optimal codebooks from relative difference sets, Adv. Math. Commun., 5 (2011), 521-527.
doi: 10.3934/amc.2011.5.521. |
Parameters |
Constraints | Ref. | |
[13] | |||
[36] | |||
[16] | |||
[16] | |||
[35] | |||
[39] | |||
[11] | |||
[11] | |||
[20] | |||
[20] | |||
[31] | |||
[31] | |||
[19] | |||
[19] | |||
[19] | |||
[19] | |||
[19] | |||
This paper |
Parameters |
Constraints | Ref. | |
[13] | |||
[36] | |||
[16] | |||
[16] | |||
[35] | |||
[39] | |||
[11] | |||
[11] | |||
[20] | |||
[20] | |||
[31] | |||
[31] | |||
[19] | |||
[19] | |||
[19] | |||
[19] | |||
[19] | |||
This paper |
[1] |
Li Zhang, Xiaofeng Zhou, Min Chen. The research on the properties of Fourier matrix and bent function. Numerical Algebra, Control and Optimization, 2020, 10 (4) : 571-578. doi: 10.3934/naco.2020052 |
[2] |
Bimal Mandal, Aditi Kar Gangopadhyay. A note on generalization of bent boolean functions. Advances in Mathematics of Communications, 2021, 15 (2) : 329-346. doi: 10.3934/amc.2020069 |
[3] |
Sihem Mesnager, Fengrong Zhang. On constructions of bent, semi-bent and five valued spectrum functions from old bent functions. Advances in Mathematics of Communications, 2017, 11 (2) : 339-345. doi: 10.3934/amc.2017026 |
[4] |
Samir Hodžić, Enes Pasalic. Generalized bent functions -sufficient conditions and related constructions. Advances in Mathematics of Communications, 2017, 11 (3) : 549-566. doi: 10.3934/amc.2017043 |
[5] |
Xiwang Cao, Hao Chen, Sihem Mesnager. Further results on semi-bent functions in polynomial form. Advances in Mathematics of Communications, 2016, 10 (4) : 725-741. doi: 10.3934/amc.2016037 |
[6] |
Makoto Araya, Masaaki Harada, Hiroki Ito, Ken Saito. On the classification of $\mathbb{Z}_4$-codes. Advances in Mathematics of Communications, 2017, 11 (4) : 747-756. doi: 10.3934/amc.2017054 |
[7] |
Jyrki Lahtonen, Gary McGuire, Harold N. Ward. Gold and Kasami-Welch functions, quadratic forms, and bent functions. Advances in Mathematics of Communications, 2007, 1 (2) : 243-250. doi: 10.3934/amc.2007.1.243 |
[8] |
Helena Rifà-Pous, Josep Rifà, Lorena Ronquillo. $\mathbb{Z}_2\mathbb{Z}_4$-additive perfect codes in Steganography. Advances in Mathematics of Communications, 2011, 5 (3) : 425-433. doi: 10.3934/amc.2011.5.425 |
[9] |
Thomas Feulner. Canonization of linear codes over $\mathbb Z$4. Advances in Mathematics of Communications, 2011, 5 (2) : 245-266. doi: 10.3934/amc.2011.5.245 |
[10] |
Tingting Wu, Jian Gao, Yun Gao, Fang-Wei Fu. $ {{\mathbb{Z}}_{2}}{{\mathbb{Z}}_{2}}{{\mathbb{Z}}_{4}}$-additive cyclic codes. Advances in Mathematics of Communications, 2018, 12 (4) : 641-657. doi: 10.3934/amc.2018038 |
[11] |
Wenying Zhang, Zhaohui Xing, Keqin Feng. A construction of bent functions with optimal algebraic degree and large symmetric group. Advances in Mathematics of Communications, 2020, 14 (1) : 23-33. doi: 10.3934/amc.2020003 |
[12] |
Jacques Wolfmann. Special bent and near-bent functions. Advances in Mathematics of Communications, 2014, 8 (1) : 21-33. doi: 10.3934/amc.2014.8.21 |
[13] |
Yulin Zhao. On the monotonicity of the period function of a quadratic system. Discrete and Continuous Dynamical Systems, 2005, 13 (3) : 795-810. doi: 10.3934/dcds.2005.13.795 |
[14] |
Amit Sharma, Maheshanand Bhaintwal. A class of skew-cyclic codes over $\mathbb{Z}_4+u\mathbb{Z}_4$ with derivation. Advances in Mathematics of Communications, 2018, 12 (4) : 723-739. doi: 10.3934/amc.2018043 |
[15] |
Raj Kumar, Maheshanand Bhaintwal. Duadic codes over $ \mathbb{Z}_4+u\mathbb{Z}_4 $. Advances in Mathematics of Communications, 2021 doi: 10.3934/amc.2020135 |
[16] |
Habibul Islam, Om Prakash, Patrick Solé. $ \mathbb{Z}_{4}\mathbb{Z}_{4}[u] $-additive cyclic and constacyclic codes. Advances in Mathematics of Communications, 2021, 15 (4) : 737-755. doi: 10.3934/amc.2020094 |
[17] |
Om Prakash, Shikha Yadav, Habibul Islam, Patrick Solé. On $ \mathbb{Z}_4\mathbb{Z}_4[u^3] $-additive constacyclic codes. Advances in Mathematics of Communications, 2022 doi: 10.3934/amc.2022017 |
[18] |
Joaquim Borges, Steven T. Dougherty, Cristina Fernández-Córdoba. Characterization and constructions of self-dual codes over $\mathbb Z_2\times \mathbb Z_4$. Advances in Mathematics of Communications, 2012, 6 (3) : 287-303. doi: 10.3934/amc.2012.6.287 |
[19] |
Yves Edel, Alexander Pott. A new almost perfect nonlinear function which is not quadratic. Advances in Mathematics of Communications, 2009, 3 (1) : 59-81. doi: 10.3934/amc.2009.3.59 |
[20] |
Ayça Çeşmelioğlu, Wilfried Meidl. Bent and vectorial bent functions, partial difference sets, and strongly regular graphs. Advances in Mathematics of Communications, 2018, 12 (4) : 691-705. doi: 10.3934/amc.2018041 |
2020 Impact Factor: 0.935
Tools
Metrics
Other articles
by authors
[Back to Top]