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

Kenneth G. Paterson (1998)

> Home

Details and statistics

DOI: 10.1023/A:1008256920596

access: closed

type: Journal Article

metadata version: 2019-06-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dcc/Paterson98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dcc/Paterson98
Kenneth G. Paterson:
Root Counting, the DFT and the Linear Complexity of Nonlinear Filtering. Des. Codes Cryptogr. 14(3): 247-259 (1998)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.