Cyclic codes from cyclotomic sequences of order four
From MaRDI portal
Publication:2447744
DOI10.1016/j.ffa.2013.03.006zbMath1305.94109arXiv1207.2571OpenAlexW2963544156MaRDI QIDQ2447744
Publication date: 28 April 2014
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.2571
Linear codes (general theory) (94B05) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Cyclic codes (94B15)
Related Items (22)
Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\) ⋮ Cyclic codes with generalized cyclotomic cubic classes ⋮ Generalized cyclotomic numbers of order two and their applications ⋮ Cyclic codes from two-prime generalized cyclotomic sequences of order 6 ⋮ Three classes of partitioned difference families and their optimal constant composition codes ⋮ Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\) ⋮ An extension of binary cyclotomic sequences having order 2lt ⋮ Codes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\) ⋮ A sequence construction of cyclic codes over finite fields ⋮ A new class of quaternary generalized cyclotomic sequences of order 2d and length 2pm with high linear complexity ⋮ Linear complexity of cyclotomic sequences of order six and BCH codes over \(\mathrm{GF}(3)\) ⋮ Cyclic codes via the general two-prime generalized cyclotomic sequence of order two ⋮ Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\) ⋮ Linear complexity of binary cyclotomic sequences of order 6 ⋮ Some cyclic codes with prime length from cyclotomy of order 4 ⋮ A generalization of combinatorial designs and related codes ⋮ Cyclic codes from the second class two-prime Whiteman's generalized cyclotomic sequence with order 6 ⋮ 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 ⋮ Partial Geometric Difference Families ⋮ Linear complexity of a class of pseudorandom sequences over a general finite field ⋮ Trace representation of Legendre sequences over non-binary fields
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On weights in duadic codes
- Hamming weights in irreducible cyclic codes
- On a class of error correcting binary group codes
- A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set
- Duadic Codes
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- Fundamentals of Error-Correcting Codes
- Several classes of binary sequences with three-level autocorrelation
- Almost difference sets and their sequences with optimal autocorrelation
- Cyclotomy and duadic codes of prime lengths
- On the minimum distance of cyclic codes
- Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
- Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes
- On the List and Bounded Distance Decodability of Reed–Solomon Codes
- On decoding BCH codes
- Difference-Set Cyclic Codes
- Generalizations of the BCH bound
This page was built for publication: Cyclic codes from cyclotomic sequences of order four
