Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting kappa symbols within one period
A unified derivation of the bounds of the linear complexity is given for a sequence obtained from a periodic sequence over GF (q) by either substituting, inserting, or deleting k symbols within one period. The lower bounds are useful in case of n < N/k, where N and n are the period and the linear...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 2000-05, Vol.46 (3), p.1174 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | A unified derivation of the bounds of the linear complexity is given for a sequence obtained from a periodic sequence over GF (q) by either substituting, inserting, or deleting k symbols within one period. The lower bounds are useful in case of n < N/k, where N and n are the period and the linear complexity of the sequence, respectively. |
|---|---|
| ISSN: | 0018-9448 1557-9654 |