"How Many Bits have to be Changed to Decrease the Linear Complexity?."

Wilfried Meidl (2004)

> Home

Details and statistics

DOI: 10.1023/B:DESI.0000035466.28660.E9

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/Meidl04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dcc/Meidl04
Wilfried Meidl:
How Many Bits have to be Changed to Decrease the Linear Complexity?. Des. Codes Cryptogr. 33(2): 109-122 (2004)

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.