The asymptotic behavior of \(N\)-adic complexity
From MaRDI portal
Publication:2470811
DOI10.3934/amc.2007.1.307zbMath1194.94179OpenAlexW1965279733MaRDI QIDQ2470811
Publication date: 15 February 2008
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2007.1.307
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Prefix, length-variable, comma-free codes (94A45)
Related Items (2)
Asymptotic analysis on the normalized \(k\)-error linear complexity of binary sequences ⋮ On the 4-adic complexity of the two-prime quaternary generator
This page was built for publication: The asymptotic behavior of \(N\)-adic complexity