Cyclic codes via the general two-prime generalized cyclotomic sequence of order two
From MaRDI portal
Publication:2228174
DOI10.1155/2020/6625652zbMath1489.94165OpenAlexW3117716714MaRDI QIDQ2228174
Publication date: 16 February 2021
Published in: Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/6625652
Cites Work
- Unnamed Item
- Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\)
- Generalized cyclotomic numbers of order two and their applications
- Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\)
- Linear complexity of generalized cyclotomic binary sequences of order 2
- New generalized cyclotomy and its applications
- Cyclic codes from cyclotomic sequences of order four
- The Bose and Minimum Distance of a Class of BCH Codes
- A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set
- Cyclotomy and duadic codes of prime lengths
- Generalized cyclotomic codes of length p/sub 1//sup e(1)/...p/sub t//sup e(t)/
- Cyclic Codes From the Two-Prime Sequences
- Cyclotomic Constructions of Cyclic Codes With Length Being the Product of Two Primes
- A family of difference sets
This page was built for publication: Cyclic codes via the general two-prime generalized cyclotomic sequence of order two