Linear complexity for one-symbol substitution of a periodic sequence over GF(q)
From MaRDI portal
Publication:4400364
DOI10.1109/18.669427zbMath0906.94013OpenAlexW2168931674MaRDI QIDQ4400364
Publication date: 18 October 1998
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.669427
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Related Items
On the k-Operation Linear Complexity of Periodic Sequences, Lower bounds on error complexity measures for periodic LFSR and FCSR sequences, An algorithm for the \(k\)-error linear complexity of sequences over GF\((p^m)\) with period \(p^n\), \( p\) a prime