Cyclic codes from cyclotomic sequences of order four
From MaRDI portal
Publication:2447744
Abstract: Cyclic codes are an interesting subclass of linear codes and have been used in consumer electronics, data transmission technologies, broadcast systems, and computer applications due to their efficient encoding and decoding algorithms. In this paper, three cyclotomic sequences of order four are employed to construct a number of classes of cyclic codes over with prime length. Under certain conditions lower bounds on the minimum weight are developed. Some of the codes obtained are optimal or almost optimal. In general, the cyclic codes constructed in this paper are very good. Some of the cyclic codes obtained in this paper are closely related to almost difference sets and difference sets. As a byproduct, the -rank of these (almost) difference sets are computed.
Recommendations
- Some cyclic codes with prime length from cyclotomy of order 4
- Cyclic codes over \(\mathbb Z_4\) of even length
- CYCLIC CODES OF EVEN LENGTH OVER Z4
- Cyclic codes over \(Z_4\) of oddly even length
- Cyclic codes of length \(2^n\) over \(\mathbb Z_4\)
- Cyclic Codes Over Gf(4) and Gf(2)
- Cyclic codes over \(\mathcal M_4(\mathbb F_2)\)
- Cyclic codes of odd length over \(\mathbb{Z}_4 [u]/u^k\)
- Cyclic codes over the ring Z₄+uZ₄
- Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1339967 (Why is no real title available?)
- scientific article; zbMATH DE number 1382769 (Why is no real title available?)
- scientific article; zbMATH DE number 3252237 (Why is no real title available?)
- A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set
- Almost difference sets and their sequences with optimal autocorrelation
- Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
- Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes
- Cyclotomy and duadic codes of prime lengths
- Difference-Set Cyclic Codes
- Duadic Codes
- Fundamentals of Error-Correcting Codes
- Generalizations of the BCH bound
- Hamming weights in irreducible cyclic codes
- On a class of error correcting binary group codes
- On decoding BCH codes
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- On the List and Bounded Distance Decodability of Reed–Solomon Codes
- On the minimum distance of cyclic codes
- On weights in duadic codes
- Several classes of binary sequences with three-level autocorrelation
Cited in
(27)- On the cyclic order distribution and partitioning of linear cyclic codes
- Cyclic codes via the general two-prime generalized cyclotomic sequence of order two
- Circular external difference families, graceful labellings and cyclotomy
- Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\)
- Codes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\)
- Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\)
- Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\)
- Cyclic codes from Whiteman's generalized cyclotomic sequences of order 8
- An extension of binary cyclotomic sequences having order 2lt
- A new class of quaternary generalized cyclotomic sequences of order 2d and length 2pm with high linear complexity
- Generalized cyclotomic numbers of order two and their applications
- The weight distributions of two classes of \(p\)-ary cyclic codes with few weights
- Recent results and problems on constructions of linear codes from cryptographic functions
- Three classes of partitioned difference families and their optimal constant composition codes
- Linear complexity of a class of pseudorandom sequences over a general finite field
- Cyclic codes with generalized cyclotomic cubic classes
- Linear complexity of cyclotomic sequences of order six and BCH codes over \(\mathrm{GF}(3)\)
- Cyclic codes from two-prime generalized cyclotomic sequences of order 6
- Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\)
- Cyclic codes from the second class two-prime Whiteman's generalized cyclotomic sequence with order 6
- Linear complexity of binary cyclotomic sequences of order 6
- Partial geometric difference families
- Some cyclic codes with prime length from cyclotomy of order 4
- A sequence construction of cyclic codes over finite fields
- A generalization of combinatorial designs and related codes
- Binary cyclic codes from trinomials over GF(\(2^m\))
- Trace representation of Legendre sequences over non-binary fields
This page was built for publication: Cyclic codes from cyclotomic sequences of order four
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2447744)
