Change search
ReferencesLink to record
Permanent link

Direct link
Synthesis of Binary Machines
KTH, School of Information and Communication Technology (ICT), Electronic Systems.ORCID iD: 0000-0001-7382-9408
2011 (English)In: IEEE Transactions on Information Theory, ISSN 0018-9448, Vol. 57, no 10, 6890-6893 p.Article in journal (Refereed) Published
Abstract [en]

The problem of constructing a binary machine with the minimum number of stages generating a given binary sequence is addressed. Binary machines are a generalization of nonlinear feedback shift registers (NLFSRs) in which both connections, feedback and feedforward, are allowed and no chain connection between the register stages is required. An algorithm for constructing a shortest binary machine generating a given periodic binary sequence is presented.

Place, publisher, year, edition, pages
2011. Vol. 57, no 10, 6890-6893 p.
Keyword [en]
Feedback shift register (FSR), nonlinear complexity, sequences
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-45588DOI: 10.1109/TIT.2011.2149495ISI: 000295739000041ScopusID: 2-s2.0-80053958871OAI: diva2:454271
Swedish Research Council, 621-2010-4388
QC 20111107Available from: 2011-11-07 Created: 2011-10-31 Last updated: 2011-11-07Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Dubrova, Elena
By organisation
Electronic Systems
In the same journal
IEEE Transactions on Information Theory
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 39 hits
ReferencesLink to record
Permanent link

Direct link