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 journal › Article
Published
| Original language | English |
|---|---|
| Pages (from-to) | 247-259 |
| Number of pages | 13 |
| Journal | Designs, Codes and Cryptography |
| Volume | 14 |
| Publication status | Published - 1998 |
ID: 1339465