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

DOI10.1007/11863854_16MaRDI QIDQ3541921zbMATH OpenOpenAlexFDO

Authors Lihua Dong, Yupu Hu, Yong Zeng

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

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

Recommendations

• 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 Z/(N)
• On the \(k\)-error linear complexity of sequences with period \(2p^{n}\) over \(GF(q)\)
• Remarks on the k-error linear complexity of p^n-periodic sequences
• An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime

Cited in

(3)

• 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 Z/(N)
• On the 2-Adic Complexity and the k-Error 2-Adic Complexity of Periodic Binary Sequences

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541921)