| Original language | English |
|---|---|
| Pages (from-to) | 247-259 |
| Number of pages | 13 |
| Journal | Designs, Codes and Cryptography |
| Volume | 14 |
| Publication status | Published - 1998 |
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver
Root Counting, the DFT and the Linear Complexity of Nonlinear Filtering
- K.G. Paterson
Research output: Contribution to journal › Article › peer-review