Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity
From MaRDI portal
Publication:1422205
DOI10.1007/s00200-003-0134-4zbMath1043.94007OpenAlexW2080188971MaRDI QIDQ1422205
Wilfried Meidl, Harald Niederreiter
Publication date: 5 February 2004
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-003-0134-4
Analysis of algorithms and problem complexity (68Q25) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items (6)
Improved results on periodic multisequences with large error linear complexity ⋮ Periodic sequences with maximal \(N\)-adic complexity and large \(k\)-error \(N\)-adic complexity over \(Z/(N)\) ⋮ FCSR periodic multisequences with maximal joint \(N\)-adic complexity and large \(k\)-error joint \(N\)-adic complexity over \(\mathbb Z/(N)\) ⋮ Periodic multisequences with large error linear complexity ⋮ Joint linear complexity of multisequences consisting of linear recurring sequences ⋮ A construction ofp-ary balanced sequence with largek-error linear complexity
This page was built for publication: Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity
