Generation of full cycles by a composition of NLFSRs (Q398953): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A55 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68P25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6331232 / rank
 
Normal rank
Property / zbMATH Keywords
 
LFSR
Property / zbMATH Keywords: LFSR / rank
 
Normal rank
Property / zbMATH Keywords
 
NLFSR
Property / zbMATH Keywords: NLFSR / rank
 
Normal rank
Property / zbMATH Keywords
 
de Bruijn sequence
Property / zbMATH Keywords: de Bruijn sequence / rank
 
Normal rank
Property / zbMATH Keywords
 
full cycle
Property / zbMATH Keywords: full cycle / rank
 
Normal rank
Property / zbMATH Keywords
 
maximum period
Property / zbMATH Keywords: maximum period / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10623-014-9947-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047978026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient implementation of the D-homomorphism for generation of de Bruijn sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3634481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5834367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Scalable Method for Constructing Galois NLFSRs With Period $2^n-1$ Using Cross-Join Pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Scheme Based on Random Boolean Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the generation of full-length shift- register sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of nonlinear de Bruijn cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Full Length Nonlinear Shift Register Cycle Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shift Register Sequences – A Retrospective Account / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of cross-join pairs in maximum length linear 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: Q4869527 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 22:37, 8 July 2024

scientific article
Language Label Description Also known as
English
Generation of full cycles by a composition of NLFSRs
scientific article

    Statements

    Identifiers