Sequences with good correlation property based on depth and interleaving techniques
From MaRDI portal
Publication:499671
DOI10.1007/s10623-014-0004-zzbMath1329.94048MaRDI QIDQ499671
Yuan Luo, Guang Gong, Min Zeng
Publication date: 30 September 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-014-0004-z
94B05: Linear codes (general theory)
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Crosscorrelation of M-sequences and GMW-sequences with the same primitive polynomial
- Rotating-table games and derivatives of words
- On evaluating the linear complexity of a sequence of least period \(2^ n\)
- On the depth distribution of linear codes
- A fast algorithm for determining the linear complexity of a sequence with period p/sup n/ over GF(q)
- A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
- Monte Carlo Methods for Index Computation (mod p)
- The depth distribution-a new characterization for linear codes
- New construction for families of binary sequences with optimal correlation properties
- New designs for signal sets with low cross correlation, balance property, and large linear span: GF(p) case
- On integer-valued rational polynomials and depth distributions of binary codes
- Linear complexity of de Bruijn sequences-old and new results
- Theory and applications of q-ary interleaved sequences
- A Three-Valued Walsh Transform From Decimations of Helleseth–Gong Sequences
- Derivatives of Binary Sequences
- A new family of ternary sequences with ideal two-level autocorrelation function
