Investigations on Periodic Sequences With Maximum Nonlinear Complexity

DOI10.1109/TIT.2017.2714681zbMath1390.94818OpenAlexW2625631934MaRDI QIDQ4566481

Xiangyong Zeng, Tor Helleseth, Zhimin Sun, Chunlei Li

Publication date: 27 June 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2017.2714681

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (5)

On finite length nonbinary sequences with large nonlinear complexity over the residue ring \(\mathbb{Z}_m\) ⋮ THE COMPLEXITY OF SUPPLY CHAIN SYSTEM’S LOGISTICS FINANCIAL MANAGEMENT AND DYNAMIC NONLINEAR SYSTEM ⋮ Finite length sequences with large nonlinear complexity ⋮ Binary sequences with period \(N\) and nonlinear complexity \(N - 2\) ⋮ Binary sequences derived from differences of consecutive quadratic residues

This page was built for publication: Investigations on Periodic Sequences With Maximum Nonlinear Complexity