Fast Algorithms for Determining the Linear Complexity of Sequences Over<tex>$hboxGF,(p^m)$</tex>With Period<tex>$2^tn$</tex>

DOI10.1109/TIT.2005.846443zbMath1294.94026OpenAlexW1512271894MaRDI QIDQ3546689

Publication date: 21 December 2008

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

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

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Related Items (4)

Fast algorithms for determining the linear complexities of sequences over $GF(p^{m})$ with the period $3 n$ ⋮ Quadratic functions with prescribed spectra ⋮ 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

This page was built for publication: Fast Algorithms for Determining the Linear Complexity of Sequences Over<tex>$hboxGF,(p^m)$</tex>With Period<tex>$2^tn$</tex>