A construction ofp-ary balanced sequence with largek-error linear complexity

DOI10.1080/09720529.2006.10698076zbMath1104.94014OpenAlexW1981075078MaRDI QIDQ3410901

C. Yogha Lakxmie, M. Sethumadhavan, C. Vijayagovindan

Publication date: 16 November 2006

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2006.10698076

zbMATH Keywords

stream ciphersbalanced sequencesgeneralized Games-Chan algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (1)

An algorithm fork-error joint linear complexity of binary multisequences

Cites Work

• Unnamed Item
• Unnamed Item
• Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity
• An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime
• A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
• A relationship between linear complexity and k-error linear complexity
• Computing the error linear complexity spectrum of a binary sequence of period 2/sup n/
• Cryptography and Coding

This page was built for publication: A construction ofp-ary balanced sequence with largek-error linear complexity