期刊论文

Peng, J

英文

IEEE Transactions on Information Theory

0018-9448

2023

69

5

2955-2968

10.1109/TIT.2022.3231966

10.13039/501100012166-National Key Research and Development Program of China (Grant Number: 2019YFB2101703) 10.13039/501100001809-National Natural Science Foundation of China (Grant Number: 61972258, 62272107 and U19A2066) Innovation Action Plan of Shanghai Science and Technology (Grant Number: 20511102200 and 21511102200) 10.13039/501100015956-Special Project for Research and Development in Key areas of Guangdong Province (Grant Number: 2020B0101090001) 10.13039/100009377-Scientific Research Fund of Hunan Provincial Education Department (Grant Number: 19B485) 10.13039/100007836-Open Research Program of Shanghai Key Laboratory of Intelligent Information Processing (Grant Number: IIPL201902)

本校为其他机构

Recently, much progress has been made to construct minimal linear codes due to their preference in secret sharing schemes and secure two-party computation. In this paper, we put forward a new method to construct minimal linear codes by using vectorial Boolean functions. Firstly, we give a necessary and sufficient condition for a generic class of linear codes from vectorial Boolean functions to be minimal. Based on that, we derive some new three-weight minimal linear codes and determine their weight distributions. Secondly, by studying deeply the construction of linear codes in this paper, we f...