.png){kind=icon}
.png){kind=icon}
Return
BINARY CYCLIC CODES FROM THREE CLASSES OF SEQUENCES
.png){kind=icon}
PRE
AI
DOI：10.3934/amc.2026007.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
. The objective of this paper is to present the construction of binary cyclic codes from three families of sequences and develop lower bounds on the minimum distances of these codes using the BCH bound. The results show that some of these codes have length n, dimension (n +/- 1)/2, minimum distance d satisfying d2 >= n, and the lower bounds on the minimum distances of certain codes are tight by extensive experiments.
Keywords:
Cyclic codes
sequences
minimum distance
BCH bound
square-root bound
Journal
A
IF:
0.7
Papers:
59
Citations:
0