Root Counting, the DFT and the Linear Complexity of Nonlinear Filtering. / Paterson, K.G.

In: Designs, Codes and Cryptography, Vol. 14, 1998, p. 247-259.

Research output: Contribution to journalArticle

Published
Original languageEnglish
Pages (from-to)247-259
Number of pages13
JournalDesigns, Codes and Cryptography
Volume14
Publication statusPublished - 1998

ID: 1339465