An improved (n,k)-NLFSR generating any a given binary sequence

DOI

10.2991/iccnce.2013.9How to use a DOI?

Keywords

Feedback Shift Register, Binary Sequence, Period

Abstract

Recently, a novel (n,k)-NLFSR was proposed by E. Dubrova etc.. In this paper, we develop a novel type of (n,k)-NLFSR, called D-FSR, which can generate all the binary sequences with period p (2n-1

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Jizhi Wang
AU  - Xueli Wu
AU  - Guang Yang
PY  - 2013/07
DA  - 2013/07
TI  - An improved (n,k)-NLFSR generating any a given binary sequence
BT  - Proceedings of the International Conference on Computer, Networks and Communication Engineering (ICCNCE 2013)
PB  - Atlantis Press
SP  - 34
EP  - 36
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccnce.2013.9
DO  - 10.2991/iccnce.2013.9
ID  - Wang2013/07
ER  -