Low-weight codewords in cyclic codes (Q6985757)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 8038258
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Low-weight codewords in cyclic codes |
scientific article; zbMATH DE number 8038258 |
Statements
Low-weight codewords in cyclic codes (English)
0 references
12 May 2025
0 references
In this paper, the authors discuss how to compute the number of low-weight codewords in cyclic codes. In the first part, they give a few results relating to counting the number of codewords with weights 2 and 3 in cyclic codes. In the section that consists of the main results, the authors establish a recursive relationship for binary cyclic codes that connects their weight distribution to the number of solutions of associated systems of polynomial equations. In the last section, they presents some applications of the obtained main result.
0 references
cyclic codes
0 references
weight distribution
0 references
binary codes
0 references
low-weight codewords
0 references
finite fields
0 references
diagonal equations
0 references
