Root Counting, the DFT and the Linear Complexity of Nonlinear Filtering

K.G. Paterson

Research output: Contribution to journalArticlepeer-review

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

Cite this