.png){kind=icon}
.png){kind=icon}
Return
BINARY SELF-ORTHOGONAL CODES WITH FEW WEIGHTS
.png){kind=icon}
PRE
AI
DOI：10.3934/amc.2026017.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
. As a special subclass of linear codes, self-orthogonal codes have received a lot of attention since these codes have very important applications in many areas including coding theory and cryptography. One of the major approaches of constructing self-orthogonal codes is the employment of some special functions, and it is in general hard to construct self-orthogonal minimal codes and determine their parameters. In this paper, we investigate this approach further by using a Gold-type function over finite fields, thereby obtaining some binary self-orthogonal codes and explicitly determine their parameters. Furthermore, the results of this paper show that these obtained self-orthogonal codes are minimal and have a few nonzero weights with at most four.
Keywords:
Linear codes
self-orthogonal codes
weight distributions
Journal
A
IF:
0.7
Papers:
59
Citations:
0