New generalized cyclotomy and its applications
From MaRDI portal
Publication:1266994
DOI10.1006/ffta.1998.0207zbMath0908.11058OpenAlexW2024297538MaRDI QIDQ1266994
Publication date: 18 March 1999
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/ffta.1998.0207
cryptographycyclotomic numberscoding theorygeneralized cyclotomic classesmultiplicative subgroupsclassical cyclotomic classes
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Cyclic codes (94B15) Cyclotomy (11T22)
Related Items
Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\) ⋮ Cyclic codes with generalized cyclotomic cubic classes ⋮ Linear Complexity of New q-ary Generalized Cyclotomic Sequences of Period $$2p^n$$ ⋮ Generalized cyclotomic numbers of order two and their applications ⋮ Generalized cyclotomic numbers with respect to prime powers ⋮ Sequences related to Legendre/Jacobi sequences ⋮ Optimal Frequency-Hopping Sequence Sets Based on Cyclotomy ⋮ New generalized cyclotomic binary sequences of period \(p^2\) ⋮ Three classes of partitioned difference families and their optimal constant composition codes ⋮ Linear complexity over \(\mathbb{F}_q\) and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation ⋮ Design sequences with high linear complexity over finite fields using generalized cyclotomy ⋮ A kind of quaternary sequences of period \(2 p^m q^n\) and their linear complexity ⋮ Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\) ⋮ Remarks on the generalized cyclotomic sequences of length \(2p^m\) ⋮ The linear complexity of generalized cyclotomic binary sequences of period \(p^n\) ⋮ On the linear complexity and autocorrelation of generalized cyclotomic binary sequences with period \(4p^n \) ⋮ Whiteman's generalized cyclotomic numbers with respect to \(t\) primes ⋮ Binary linear codes with two or three weights from Niho exponents ⋮ Linear complexity of generalized cyclotomic sequences with period \(p^nq^m\) ⋮ Cyclotomy and arithmetic properties of some families in Z[x/〈xpq − 1〉] ⋮ Two classes of near-optimal frequency-hopping sequence sets with prime-power period ⋮ Pseudo-randomness of certain sequences of \(k\) symbols with length \(pq\) ⋮ 2-Adic Complexity of Two Classes of Generalized Cyclotomic Binary Sequences ⋮ About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\) ⋮ On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\) ⋮ Linear Complexity and Autocorrelation of Prime Cube Sequences ⋮ 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 ⋮ A new family of optimal FHS sets with composite lengths ⋮ Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\) ⋮ Trace representation of some generalized cyclotomic sequences of length \(pq\) ⋮ The linear complexity of a class of binary sequences with period \(2p\) ⋮ The linear complexity of new generalized cyclotomic binary sequences of order four ⋮ A class of linear codes with two weights or three weights from some planar functions ⋮ On the linear complexity of generalized cyclotomic sequences with the period \(p^m\) ⋮ Linear complexity and trace representation of quaternary sequences over \(\mathbb {Z}_{4}\) based on generalized cyclotomic classes modulo \( pq\) ⋮ Cyclic codes from the second class two-prime Whiteman's generalized cyclotomic sequence with order 6 ⋮ Cryptographic properties of some binary generalized cyclotomic sequences with the length \(p^{2}\) ⋮ Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\) ⋮ Generalized cyclotomic numbers and cyclic codes of prime power length over Z4 ⋮ Large families of pseudo-random subsets formed by generalized cyclotomic classes ⋮ On the properties of generalized cyclotomic binary sequences of period \(2p^m\) ⋮ Autocorrelation and linear complexity of binary generalized cyclotomic sequences with period \(pq\) ⋮ 2-Adic and Linear Complexities of a Class of Whiteman’s Generalized Cyclotomic Sequences of Order Four ⋮ Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients ⋮ Linear complexity of a class of pseudorandom sequences over a general finite field ⋮ Linear complexity of binary Whiteman generalized cyclotomic sequences of order \(2^k\) ⋮ Remarks on a cyclotomic sequence ⋮ The linear complexity of generalized cyclotomic sequences with period \(2p^n\) ⋮ Linear complexity and correlation of a class of binary cyclotomic sequences ⋮ Symmetric 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period \(pq\) ⋮ Linear complexity of Ding-Helleseth generalized cyclotomic sequences of order eight ⋮ Linear complexity of generalized cyclotomic sequences of period \(2p^m\) ⋮ NEW OPTIMAL FREQUENCY HOPPING SEQUENCE SETS FROM BALANCED NESTED DIFFERENCE PACKINGS OF PARTITION-TYPE
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- De Bruijn sequences, irreducible codes and cyclotomy
- Cyclic difference sets
- Euler products, cyclotomy, and coding
- Cyclotomic numbers, coding theory and orthogonal polynomials
- Duadic Codes
- A New Form of the Square Root Bound
- Design of Sequences with Specified Autocorrelation and Cross Correlation
- Cyclotomy, Higher Congruences, and Waring's Problem
- Binary pulse compression codes
- A family of difference sets
