Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Fast algorithms for determining the linear complexity of sequences over ..."

Hao Chen (2005)

> Home

Details and statistics

DOI: 10.1109/TIT.2005.846443

access: closed

type: Journal Article

metadata version: 2022-06-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tit/Chen05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/Chen05
Hao Chen:
Fast algorithms for determining the linear complexity of sequences over GF(p^m) with period 2^tn. IEEE Trans. Inf. Theory 51(5): 1854-1856 (2005)

a service of

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.