An Algorithm for Constructing a Fastest Galois NLFSR Generating a Given Sequence

DOI10.1007/978-3-642-15874-2_3zbMath1257.94015OpenAlexW2136205168MaRDI QIDQ3588573

Shohreh Sharif Mansouri, Jean-Michel Chabloz, Elena Dubrova

Publication date: 8 September 2010

Published in: Sequences and Their Applications – SETA 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15874-2_3

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Related Items (1)

An Equivalence-Preserving Transformation of Shift Registers

This page was built for publication: An Algorithm for Constructing a Fastest Galois NLFSR Generating a Given Sequence