On an Improvement of a Result by Niederreiter and Wang Concerning the Expected Linear Complexity of Multisequences

Simple item page
dc.creatorMoshchevitin, Nikolai
dc.creatorVielhaber, Michael
dc.date2007-03-22
dc.date2007-10-20
dc.date.accessioned2026-07-07T08:37:10Z
dc.date.available2026-07-07T08:37:10Z
dc.descriptionWe show that the expected value for the linear complexity of $m$-multisequences of length $n$ is E_n^{(m)} = n m/(m+1) + O(1).
dc.description5 pages, minor corrections of the proofs
dc.identifierhttps://arxiv.org/abs/math/0703655
dc.identifierhttp://arxiv.org/abs/math/0703655
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/140310
dc.subjectNumber Theory
dc.subject11B85
dc.titleOn an Improvement of a Result by Niederreiter and Wang Concerning the Expected Linear Complexity of Multisequences
dc.typetext

Files

Collections

arXiv