一类基于布尔函数的极小线性码的构造
Construction of a Class of Minimal Binary Linear Code Based on Boolean Function
DOI: 10.12677/PM.2021.119179, PDF,   
作者: 杜佳玮:西北师范大学数学与统计学院,甘肃 兰州
关键词: 布尔函数Bent函数Walsh变换二元线性码Boolean Function Bent Function Walsh Transform Binary Linear Code
摘要: 具有较低重量的线性码在数据存储系统、设计具有良好访问结构的秘密共享方案等领域有着重要的应用。基于布尔函数的Walsh谱值分布,该文利用一类具有五值Walsh谱的布尔函数构造了一类具有六重的线性码,确定了码的参数及其重量分布,并编制Magma程序验证了结论的正确性。结果表明,所构造的码为不满足A~B条件的极小线性码,且可用来设计具有良好访问结构的秘密共享方案。
Abstract: Linear codes with few-weight have important applications in data storage system and designing the secret sharing scheme with good access structures. Based on the Walsh spectrum distribution of Boolean function, this paper constructs a class of Boolean functions with five-valued Walsh spectra. The type of six-weight linear code is derived from this new function, and parameters of the code such as length and dimension are determined. And magma program is used to verify the correctness of the conclusion. The results show that the new code is minimal linear code which does not satisfy the A-B condition, and it can be used to design the secret sharing scheme with good access structures.
文章引用:杜佳玮. 一类基于布尔函数的极小线性码的构造[J]. 理论数学, 2021, 11(9): 1623-1629. https://doi.org/10.12677/PM.2021.119179

参考文献

[1] Carlet, C. (2010) Boolean Function for Cryptography and Error Correcting Codes. In: Crama, Y. and Hammer, P., Eds., Chapter of the Monography Boolean Models and Methods in Mathematics, Computer Science, and Engineering, Cam-bridge University Press, Cambridge, 257-397. [Google Scholar] [CrossRef
[2] Khoo, K. (2004) Sequence Design and Construction of Cryptographic Boolean Functions. Ph.D. Thesis, University of Waterloo (Canda), Waterloo.
[3] Carlet, C., Charpin, P. and Zinoviev, V. (1998) Codes, Bent Functions and Permutations Suitable for DES-Like Cryptosystems. Designs, Codes and Cryptography, 15, 125-156. [Google Scholar] [CrossRef
[4] Pang, T., Zeng, X., Li, N. and Xu, Y. (2020) A Class of New Quadratic Vectorial Bent Functions. Chinese Journal of Electronics, 29, 85-91. [Google Scholar] [CrossRef
[5] Kumar, P.V., Scholtz, R.A. and Welch, L.R. (1985) Generalized Bent Functions and Their Properties. Journal of Combinatorial Theory, Series A, 40, 90-107. [Google Scholar] [CrossRef
[6] Ding, C. and Wang, X. (2005) A Coding Theory Construction of New Systematic Authentication Codes. Theoretical Computer Science, 330, 81-99. [Google Scholar] [CrossRef
[7] Yuan, J. and Ding, C. (2006) Secret Sharing Schemes from Three Classes of Linear Codes. IEEE Transactions on Information Theory, 52, 206-212. [Google Scholar] [CrossRef
[8] Baumert, L.D. and Mceliece, R.J. (1972) Weights of Irreducible Cyclic Codes. Information and Control, 20, 158-175. [Google Scholar] [CrossRef
[9] Ding, C., Heng, Z. and Zhou, Z. (2018) Minimal Binary Linear Codes. IEEE Transactions on Information Theory, 64, 6536-6545. [Google Scholar] [CrossRef
[10] Lidl, R. and Niederreiter, H. (1997) Finite Fields. 2nd Edition, Cambridge University Press, Cambridge. [Google Scholar] [CrossRef
[11] Helleseth, T. and Kholosha, A. (2006) Monomial and Quadratic Bent Functions over the Finite Fields of Odd Characteristic. IEEE Transactions on Information Theory, 52, 2018-2032. [Google Scholar] [CrossRef
[12] Ashikhmin, A. and Barg, A. (1998) Minimal Vectors in Linear Codes. IEEE Transactions on Information Theory, 44, 2010-2017. [Google Scholar] [CrossRef