Cyclic codes via the general two-prime generalized cyclotomic sequence of order two
Summary: Suppose that \(p\) and \(q\) are two distinct odd prime numbers with \(n=pq\). In this paper, the uniform representation of general two-prime generalized cyclotomy with order two over \(\mathbb{Z}_n\) was demonstrated. Based on this general generalized cyclotomy, a type of binary sequences defined over \(\mathbb{F}_l\) was presented and their minimal polynomials and linear complexities were derived, where \(l= r^s\) with a prime number \(r\) and \(\gcd (l,n)=1\). The results have indicated that the linear complexities of these sequences are high without any special requirements on the prime numbers. Furthermore, we employed these sequences to obtain a few cyclic codes over \(\mathbb{F}_l\) with length \(n\) and developed the lower bounds of the minimum distances of many cyclic codes. It is important to stress that some cyclic codes in this paper are optimal.
- Cyclic codes from two-prime generalized cyclotomic sequences of order 6
- Cyclic codes from the first class two-prime Whiteman's generalized cyclotomic sequence with order 6
- Cyclic codes from the second class two-prime Whiteman's generalized cyclotomic sequence with order 6
- Cyclic codes from Whiteman's generalized cyclotomic sequences of order \(2l\), \(l \geq 2\)
- Linear complexity of generalized cyclotomic binary sequences of period \(pq\)
- A family of difference sets
- A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set
- Cyclic codes from cyclotomic sequences of order four
- Cyclic Codes From the Two-Prime Sequences
- Cyclotomic Constructions of Cyclic Codes With Length Being the Product of Two Primes
- Cyclotomy and duadic codes of prime lengths
- Generalized cyclotomic codes of length p/sub 1//sup e(1)/...p/sub t//sup e(t)/
- Generalized cyclotomic numbers of order two and their applications
- scientific article; zbMATH DE number 3252237 (Why is no real title available?)
- Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\)
- Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\)
- Linear complexity of generalized cyclotomic binary sequences of order 2
- New generalized cyclotomy and its applications
- The Bose and Minimum Distance of a Class of BCH Codes
- Cyclic codes from two-prime generalized cyclotomic sequences of order 6
- Generalized cyclotomic codes of length p/sub 1//sup e(1)/...p/sub t//sup e(t)/
- Cyclic codes from the first class two-prime Whiteman's generalized cyclotomic sequence with order 6
- Some cyclic codes with prime length from cyclotomy of order 4
- Cyclic codes from the second class two-prime Whiteman's generalized cyclotomic sequence with order 6
- Cyclic codes from Whiteman's generalized cyclotomic sequences of order \(2l\), \(l \geq 2\)
This page was built for publication: Cyclic codes via the general two-prime generalized cyclotomic sequence of order two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2228174)
