Year: 2021
Type: preprint
Abstract: In this paper, for any odd prime $p$ and an integer $m\ge 3$, several classes of linear codes with $t$-weight $(t=3,5,7)$ are obtained based on some defining sets, and then their complete weight enumerators are determined explicitly by employing Gauss sums and quadratic character sums. Especially for $m = 3$, a class of MDS codes with parameters $[p,3,p-2]$ are obtained. Furthermore, some of these codes can be suitable for applications in secret sharing schemes and $s$-sum sets for any odd $s>1$.
Source: arXiv (Cornell University)
Authors: Zhu, Canze, Liao, Qunying
Institution: Sichuan Normal University
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Award: 剩余码的设计及其相关的编码、译码问题研究
OpenAlex ID: W4293794727