Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction (Q1744015): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10623-017-0375-z / 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.1007/s10623-017-0375-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2641752866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback With Carry Shift Registers Synthesis With the Euclidean Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized Euclidean algorithm for multisequence shift-register synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Shift Register Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Multisequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4343440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback shift registers, 2-adic span, and combiners with memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Register synthesis for algebraic feedback shift registers based on non-primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shift-register synthesis and BCH decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: An LLL Algorithm with Quadratic Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-dimensional lattice basis reduction revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(F[x]\)-lattice basis reduction algorithm and multisequence synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the joint 2-adic complexity of binary multisequences / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10623-017-0375-Z / rank
 
Normal rank

Latest revision as of 07:33, 11 December 2024

scientific article
Language Label Description Also known as
English
Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction
scientific article

    Statements

    Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction (English)
    0 references
    0 references
    0 references
    0 references
    16 April 2018
    0 references
    multi-sequences
    0 references
    lattice basis reduction algorithm
    0 references
    FCSR synthesis problem
    0 references

    Identifiers