On the Joint Linear Complexity of Linear Recurring Multisequences

From MaRDI portal

Revision as of 04:32, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3614600

Jump to:navigation, search

DOI10.1142/9789812832245_0010zbMath1160.94007OpenAlexW2333769225MaRDI QIDQ3614600

Harald Niederreiter, Ferruh Özbudak, Fang-Wei Fu

Publication date: 9 March 2009

Published in: Coding and Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/9789812832245_0010

zbMATH Keywords

variance expectation linear recurring sequence joint linear complexity Multisequence

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Recurrences (11B37)

Related Items (2)

Joint linear complexity of arbitrary multisequences consisting of linear recurring sequences ⋮ How to determine linear complexity and \(k\)-error linear complexity in some classes of linear recurring sequences

This page was built for publication: On the Joint Linear Complexity of Linear Recurring Multisequences

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3614600&oldid=17045375"