Counting functions and expected values for the lattice profile at \(n\) (Q2566959): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Yaochen Zhu / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Yaochen Zhu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ffa.2004.01.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2077163810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice structure and linear complexity profile of nonlinear pseudorandom number generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4453508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4832278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4695307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shift-register synthesis and BCH decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting functions and expected values for the \(k\)-error linear complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3782636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3797089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Theory of Linear Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4549492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice structure and linear complexity of nonlinear pseudorandom numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis and design of stream ciphers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004196 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:01, 10 June 2024

scientific article
Language Label Description Also known as
English
Counting functions and expected values for the lattice profile at \(n\)
scientific article

    Statements

    Counting functions and expected values for the lattice profile at \(n\) (English)
    0 references
    0 references
    0 references
    0 references
    29 September 2005
    0 references
    Let \(\eta= (\eta_1,\eta_2,\dots)\) be a sequence over the finite field \(\mathbb F_q\). We say that \(\eta\) passes the \(S\)-dimensional \(n\)-lattice test \((n\geq 2)\) if the vectors \(\{\eta_j- \eta_1\mid 2\leq j\leq n- S+ 1\}\text{\,span\,}\mathbb F^S_q\), where \(\eta_j= (\eta_j, \eta_{j+1},\dots, \eta_{j+S-1})\), \(1\leq j\leq n-S+ 1\). For \(n\geq 2\), let \(S_n(\eta)\) be the greatest \(S\) such that \(\eta\) passes the \(S\)-dimensional \(n\)-lattice test, and call it the \(n\)th lattice level of \(\eta\) (or the lattice profile of \(\eta\) at \(n\)). We also define \(S_0(\eta)= S_1(\eta)= 0\). Basing on the earlier works by the first and the third author [Appl. Algebra Eng. Commun. Comput. 13, No. 6, 499--508 (2003 Zbl 1026.11064); Lect. Notes Comput. Sci. 2948, 69--78 (2004; Zbl 1058.65009)], the authors determine the number of sequences \(\eta\) over \(\mathbb F_q\) of length \(n\) with \(S_n(\eta)= S\) (\(n\geq 1\), \(S\geq 0\)), and give the exact formulas for the expected value and the variance of the \(n\)th lattice level of an arbitrary sequence \(\eta\) over \(\mathbb F_q\). Further, they also determine the number of finite sequences over \(\mathbb F_q\) with length \(n\), linear complexity \(L\) and the \(n\)th lattice level \(S\). Moreover, in the binary case, they show that the infinite sequence \(\eta\) has maximal possible \(n\)th lattice level for all \(n= 0,1,\dots\) (i.e. \(S_n(\eta)= \lfloor n/2\rfloor\) for all \(n\geq 0\)) if and only if \(\eta_i+ \eta_{2i}= 1\) for \(i= 1,2,\dots\).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    sequences over finite fields
    0 references
    Marsaglia's lattice test
    0 references
    linear complexity
    0 references
    0 references
    0 references