On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\) (Q1949238): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10623-012-9610-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046715444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4207994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary sequences with optimal autocorrelation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4208589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Complexity of Some Generalized Cyclotomic Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized cyclotomic codes of length p/sub 1//sup e(1)/...p/sub t//sup e(t)/ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5713307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Complexity and Autocorrelation of Prime Cube Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shift-register synthesis and BCH decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear complexity of generalized cyclotomic sequences with the period \(p^m\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\) / rank
 
Normal rank

Latest revision as of 09:40, 6 July 2024

scientific article
Language Label Description Also known as
English
On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\)
scientific article

    Statements

    On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\) (English)
    0 references
    0 references
    0 references
    0 references
    6 May 2013
    0 references
    binary sequences
    0 references
    generalized cyclotomy
    0 references
    linear complexity
    0 references
    autocorrelation
    0 references
    balance
    0 references

    Identifiers

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