Construction of a Class of Ternary Minimal Linear Codes
Minimal linear codes, as a special category of linear codes, are critically important in applications such as se-cret sharing schemes and secure multi-party computation. It is of great significance to construct minimal linear codes over fi-nite fields. Based on exponential sum, Krawtchouk polynomials and functions defined on special vector sets, we construct a new class of ternary minimal linear codes that do not satisfy the Ashikhmin-Barg condition, and then determine their weight distribution and complete weight enumerator.
linear codesminimal linear codeshamming weightcomplete weight enumerator
国家科技期刊平台
NSTL
万方数据
