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 MoreMetadata
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)
DOI: 10.1109/18.669427