一类基于向量布尔函数构造的极小二无线性码
Minimal Binary Linear Codes from a Class of Vectorial Boolean Functions
DOI: 10.12677/AAM.2022.128349, PDF, 下载: 137  浏览: 227 
作者: 吴昊:西北师范大学数学与统计学院,甘肃 兰州
关键词: 线性码极小码向量布尔函数重量分布Linear Code Minimal Code Vectorial Boolean Function Weight Distribution
摘要: 线性码在数据储存、通信、密码学和组合数学等方面都有着重要的应用, 其中的极小线性码可以用 来构造具有良好访问结构的秘密共享方案. 本文利用向量布尔函数构造了一类新的二无线性码, 并且利用布尔函数的密码学性质研究了线性码的长度, 维数和重量分布. 结论表明, 所构造的线性码 最小距离更大且为宽极小码. 此外, 本文将现有的一些结果推广到一般情形.
Abstract: The applications of linear codes in data storage, communication, cryptography and combinatorial mathematics have been of great importance over the years, among which minimal linear codes can be used to construct secret sharing schemes with good ac- cess structure. In this paper, we construct a new class of binary linear codes using vectorial Boolean functions, and study the length, dimension and weight distribution of linear codes using the cryptographic properties of Boolean functions. The results show that the constructed linear codes have larger minimum distance and are wide minimal codes. At the same time, this article extends some existing results to general situations.
文章引用:吴昊. 一类基于向量布尔函数构造的极小二无线性码[J]. 应用数学进展, 2023, 12(8): 3507-3517. https://doi.org/10.12677/AAM.2022.128349

参考文献

[1] Anderson, R., Ding, C., Helleseth, T., et al. (1998) How to Build Robust Shared Control Systems. Designs, Codes and Cryptography, 15, 111-124.
https://doi.org/10.1023/A:1026421315292
[2] Ding, K. and Ding, C. (2015) A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing. IEEE Transactions on Information Theory, 61, 5835-5842.
https://doi.org/10.1109/TIT.2015.2473861
[3] Ding, C. and Wang, X. (2005) A Coding Theory Construction of New Systematic Authenti- cation Codes. Theoretical Computer Science, 330, 81-99.
https://doi.org/10.1016/j.tcs.2004.09.011
[4] Delsarte, P. and Levenshtein, V.I. (1998) Association Schemes and Coding Theory. IEEE Transactions on Information Theory, 44, 2477-2504.
https://doi.org/10.1109/18.720545
[5] Ashikhmin, A. and Barg, A. (1998) Minimal Vectors in Linear Codes. IEEE Transactions on Information Theory, 44, 2010-2017.
https://doi.org/10.1109/18.705584
[6] Ding, C. (2015) Linear Codes from Some 2-Designs. IEEE Transactions on Information Theory, 61, 3265-3275.
https://doi.org/10.1109/TIT.2015.2420118
[7] Heng, Z. and Yue, Q. (2015) A Class of Binary Linear Codes with at Most Three Weights. IEEE Communications Letters, 19, 1488-1491.
https://doi.org/10.1109/LCOMM.2015.2455032
[8] Heng, Z., Yue, Q. and Li, C. (2016) Three Classes of Linear Codes with Two or Three Weights. Discrete Mathematics, 339, 2832-2847.
https://doi.org/10.1016/j.disc.2016.05.033
[9] Tang, C., Li, N., Qi, Y., et al. (2016) Linear Codes with Two or Three Weights from Weakly Regular Bent Functions. IEEE Transactions on Information Theory, 62, 1166-1176.
https://doi.org/10.1109/TIT.2016.2518678
[10] Tang, C., Qi, Y. and Huang, D. (2015) Two-Weight and Three-Weight Linear Codes from Square Functions. IEEE Communications Letters, 20, 29-32.
https://doi.org/10.1109/LCOMM.2015.2497344
[11] Chang, S. and Hyun, J.Y. (2018) Linear Codes from Simplicial Complexes. Designs, Codes and Cryptography, 86, 2167-2181.
https://doi.org/10.1007/s10623-017-0442-5
[12] Ding, C., Heng, Z. and Zhou, Z. (2018) Minimal Binary Linear Codes. IEEE Transactions on Information Theory, 64, 6536-6545.
https://doi.org/10.1109/TIT.2018.2819196
[13] Bartoli, D. and Bonini, M. (2019) Minimal Linear Codes in Odd Characteristic. IEEE Trans- actions on Information Theory, 65, 4152-4155.
https://doi.org/10.1109/TIT.2019.2891992
[14] Bonini, M. and Borello, M. (2021) Minimal Linear Codes Arising from Blocking Sets. Journal of Algebraic Combinatorics, 53, 327-341.
https://doi.org/10.1007/s10801-019-00930-6
[15] Ding, C. (2016) A Construction of Binary Linear Codes from Boolean Functions. Discrete Mathematics, 339, 2288-2303.
https://doi.org/10.1016/j.disc.2016.03.029
[16] Carlet, C. and Ding, C. (2007) Nonlinearities of S-Boxes. Finite Fields and Their Applications, 13, 121-135.
https://doi.org/10.1016/j.ffa.2005.07.003
[17] Wadayama, T., Hada, T., Wakasugi, K., et al. (2001) Upper and Lower Bounds on Maximum Nonlinearity of n-Input m-Output Boolean Function. Designs, Codes and Cryptography, 23, 23-34.
https://doi.org/10.1023/A:1011207501748
[18] Tang, D. and Li, X. (2020) A Note on Theminimal Binary Linear Code. Cryptography and Communications, 12, 375-388.
https://doi.org/10.1007/s12095-019-00412-3
[19] Li, X. and Yue, Q. (2020) Four Classes of Minimal Binary Linear Codes with wmin/wmax < 1/2 Derived from Boolean Functions. Designs, Codes and Cryptography, 88, 257-271.
https://doi.org/10.1007/s10623-019-00682-1
[20] Lu, W., Wu, X. and Cao, X. (2021) The Parameters of Minimal Linear Codes. Finite Fields and Their Applications, 71, Article 101799.
https://doi.org/10.1016/j.ffa.2020.101799