Hamming correlation properties of the array structure of Sidelnikov sequences
From MaRDI portal
Publication:2329395
DOI10.1007/s10623-019-00636-7zbMath1421.94032OpenAlexW2942094095MaRDI QIDQ2329395
Publication date: 17 October 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-019-00636-7
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Communication theory (94A05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Combinatorial characterizations of one-coincidence frequency-hopping sequences
- Further combinatorial constructions for optimal frequency-hopping sequences
- New <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula>-Ary Sequence Families With Low Correlation From the Array Structure of Sidelnikov Sequences
- Optimal Frequency-Hopping Sequences Via Cyclotomy
- Optimal Frequency Hopping Sequences: A Combinatorial Approach
- Lower Bounds on the Hamming Auto- and Cross Correlations of Frequency-Hopping Sequences
- Cross Correlation of Sidel'nikov Sequences and Their Constant Multiples
- Algebraic Constructions of Optimal Frequency-Hopping Sequences
- Sets of Optimal Frequency-Hopping Sequences
- New Families of $M$-Ary Sequences With Low Correlation Constructed From Sidel'nikov Sequences
- On the nonperiodic cyclic equivalence classes of Reed-Solomon codes
- Families of sequences with optimal Hamming-correlation properties
- Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings
- On the Sidel'nikov Sequences as Frequency-Hopping Sequences
- New Classes of Optimal Frequency-Hopping Sequences by Interleaving Techniques
- Optimal Frequency Hopping Sequences: Auto- and Cross-Correlation Properties
- New $M$-Ary Sequence Families With Low Correlation and Large Size
- Sets of Frequency Hopping Sequences: Bounds and Optimal Constructions
- New Construction of $M$-Ary Sequence Families With Low Correlation From the Structure of Sidelnikov Sequences
- kth-Order Near-Orthogonal Codes (Corresp.)
This page was built for publication: Hamming correlation properties of the array structure of Sidelnikov sequences