Computing the k-Error N-Adic Complexity of a Sequence of Period p n

DOI10.1007/11863854_16zbMath1152.94379OpenAlexW1513557122MaRDI QIDQ3541921

Lihua Dong, Yong Zeng, Yu Pu Hu

Publication date: 27 November 2008

Published in: Sequences and Their Applications – SETA 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11863854_16

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (2)

Periodic sequences with maximal \(N\)-adic complexity and large \(k\)-error \(N\)-adic complexity over \(Z/(N)\) ⋮ FCSR periodic multisequences with maximal joint \(N\)-adic complexity and large \(k\)-error joint \(N\)-adic complexity over \(\mathbb Z/(N)\)

This page was built for publication: Computing the k-Error N-Adic Complexity of a Sequence of Period p n