Reducing the Computation of Linear Complexities of Periodic Sequences Over ${\hbox {GF}}(p^m)$

DOI10.1109/TIT.2006.885512zbMath1309.94124MaRDI QIDQ3548059

Hao Chen

Publication date: 21 December 2008

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

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Related Items

Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm ⋮ How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences