Cyclic codes from two-prime generalized cyclotomic sequences of order 6 Article Swipe
Related Concepts
Mathematics
Finite field
Cyclic group
Prime (order theory)
Order (exchange)
Minimum distance
Cyclic code
Cyclotomic polynomial
Generator (circuit theory)
Binary number
Combinatorics
Discrete mathematics
Block code
Linear code
Polynomial
Arithmetic
Algorithm
Decoding methods
Mathematical analysis
Abelian group
Physics
Quantum mechanics
Economics
Power (physics)
Finance
Tongjiang Yan
,
Yanyan Liu
,
Yuhua Sun
·
YOU?
·
· 2016
· Open Access
·
· DOI: https://doi.org/10.3934/amc.2016036
· OA: W2963375796
YOU?
·
· 2016
· Open Access
·
· DOI: https://doi.org/10.3934/amc.2016036
· OA: W2963375796
Cyclic codes have wide applications in data storage systems and communication systems. Employing binary two-prime Whiteman generalized cyclotomic sequences of order 6, we construct several classes of cyclic codes over the finite field $\mathrm{GF}(q)$ and give their generator polynomials. And we also calculate the minimum distance of some cyclic codes and give lower bounds on the minimum distance for some other cyclic codes.
Related Topics
Finding more related topics…