Theory and applications of q-ary interleaved sequences
From MaRDI portal
Publication:4838665
DOI10.1109/18.370141zbMath0943.94509OpenAlexW2135733034MaRDI QIDQ4838665
Publication date: 28 August 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.370141
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Related Items (41)
2-adic complexity of two constructions of binary sequences with period \(4N\) and optimal autocorrelation magnitude ⋮ Linearity in decimation-based generators: an improved cryptanalysis on the shrinking generator ⋮ The symmetric 2-adic complexity of sequences with optimal autocorrelation magnitude and length \(8q\) ⋮ The 2-adic complexity of Yu-Gong sequences with interleaved structure and optimal autocorrelation magnitude ⋮ Strategic attack on the shrinking generator ⋮ On the use of cellular automata in symmetric cryptography ⋮ Construction of low-hit-zone frequency hopping sequences with optimal partial Hamming correlation by interleaving techniques ⋮ An algebra of arrays and almost perfect watermarks ⋮ Linear complexity profile and correlation measure of interleaved sequences ⋮ Constructions of optimal low hit zone frequency hopping sequence sets with large family size ⋮ Correlation properties of interleaved Legendre sequences and Ding-Helleseth-Lam sequences ⋮ Cryptanalytic Attack on Cryptographic Sequence Generators: The Class of Clock-Controlled Shrinking Generators ⋮ A Super-Set of Patterson--Wiedemann Functions: Upper Bounds and Possible Nonlinearities ⋮ On three conjectures of binary sequences with low odd-periodic autocorrelation ⋮ The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude ⋮ A note on character sums with polynomial arguments. ⋮ New classes of strictly optimal low hit zone frequency hopping sequence sets ⋮ Modelling nonlinear sequence generators in terms of linear cellular automata ⋮ Notes on \(q\)-ary interleaved sequences ⋮ Cellular Automata-Based Structures to Compute the Solutions of Linear Difference Equations ⋮ Nonlinear Pseudorandom Sequences Based on 90/150 LHGCA ⋮ On shift sequences for interleaved construction of signal sets with low correlation ⋮ Recursion polynomials of unfolded sequences ⋮ Sequences with good correlation property based on depth and interleaving techniques ⋮ A general construction of binary interleaved sequences of period \(4{N}\) with optimal autocorrelation ⋮ New almost perfect, odd perfect, and perfect sequences from difference balanced functions with \(d\)-form property ⋮ New optimal binary sequences with period \(4p\) via interleaving Ding-Helleseth-Lam sequences ⋮ On discrete stochastic processes generated by deterministic sequences and multiplication machines ⋮ 2-adic complexity of binary sequences with interleaved structure ⋮ Patterson-Wiedemann construction revisited ⋮ Design of M-Ary Low Correlation Zone Sequence Sets by Interleaving ⋮ Existence of Modular Sonar Sequences of Twin-Prime Product Length ⋮ Low-hit-zone frequency hopping sequence sets with optimal partial Hamming correlation properties ⋮ New \(M\)-ary sequences with low autocorrelation from interleaved technique ⋮ Synthesis of cryptographic interleaved sequences by means of linear cellular automata ⋮ Linear complexity of generalized sequences by comparison of PN-sequences ⋮ A note on nonuniform decimation of periodic sequences ⋮ Linear recurrences with polynomial coefficients ⋮ Families of \(p\)-ary sequences with low correlation and large linear complexity ⋮ Patterson-Wiedemann Construction Revisited ⋮ A Super-Set of Patterson-Wiedemann Functions – Upper Bounds and Possible Nonlinearities
This page was built for publication: Theory and applications of q-ary interleaved sequences
