𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3 (Q3400065): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of balanced binary sequences with optimal autocorrelation properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/ / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1515/jmc.2009.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041127709 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:29, 30 July 2024

scientific article
Language Label Description Also known as
English
𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3
scientific article

    Statements

    𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3 (English)
    0 references
    0 references
    0 references
    5 February 2010
    0 references
    Sidelnikov sequences
    0 references
    linear complexity
    0 references
    binomial coefficients modulo \(p\)
    0 references
    character sums
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references