Binary self-orthogonal codes with few weights
Abstract
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.
Fields of Study & Subjects
Coding theory and cryptography
graph theory and CDMA systems
Advanced Combinatorial Mathematics
Publication details
- Journal / source
- Advances in Mathematics of Communications
- Volume
- 23
- Issue
- 0
- Pages
- 146–156
- Publication date
- 1 January 2026
- Language
- EN