Loading [MathJax]/extensions/MathMenu.js
Linear complexity for one-symbol substitution of a periodic sequence over GF(q) | IEEE Journals & Magazine | IEEE Xplore

Linear complexity for one-symbol substitution of a periodic sequence over GF(q)


Abstract:

It is shown that the linear complexity for one-symbol substitution of any periodic sequence over GF(q) can be computed without any condition on the minimal polynomial of ...Show More

Abstract:

It is shown that the linear complexity for one-symbol substitution of any periodic sequence over GF(q) can be computed without any condition on the minimal polynomial of the sequence.
Published in: IEEE Transactions on Information Theory ( Volume: 44, Issue: 3, May 1998)
Page(s): 1328 - 1331
Date of Publication: 31 May 1998

ISSN Information:


References

References is not available for this document.