On the $2$-Adic Complexity and the $k$-Error $2$-Adic Complexity of Periodic Binary Sequences

DOI10.1109/TIT.2007.913238zbMath1311.94062OpenAlexW2164099144MaRDI QIDQ3604650

Dengguo Feng, Hong Gang Hu

Publication date: 24 February 2009

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

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

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Approximation algorithms (68W25)

Related Items (7)

The symmetric 2-adic complexity of sequences with optimal autocorrelation magnitude and length \(8q\) ⋮ Expected values for the rational complexity of finite binary sequences ⋮ Symmetric 4-adic complexity of quaternary generalized cyclotomic sequences of order four with period \(2p^n\) ⋮ Estimate of 4-adic complexity of unified quaternary sequences of length \(2p \) ⋮ 2-adic complexity of binary sequences with interleaved structure ⋮ Symmetric 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period \(pq\) ⋮ On the 4-adic complexity of the two-prime quaternary generator

This page was built for publication: On the $2$-Adic Complexity and the $k$-Error $2$-Adic Complexity of Periodic Binary Sequences