An efficient implementation of the D-homomorphism for generation of de Bruijn sequences

DOI10.1109/18.761285zbMATH Open0957.94020OpenAlexW2128522106MaRDI QIDQ4701385FDOQ4701385

Authors: Taejoo Chang, Bongjoo Park, Yun Hee Kim, Iickho Song 

Publication date: 21 November 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/fdbb4f06b280fb7abbb347ac4fdc65b621993f1b

Recommendations

• An efficient algorithm for generation of de Bruijn sequences over the ring \(F_2+uF_2\) by raising stage
• An efficient algorithm for the generation of DeBruijn cycles
• Algorithms for the generation of full-length shift- register sequences
• An efficiently generated family of binary de Bruijn sequences
• scientific article; zbMATH DE number 2188425

zbMATH Keywords

de Bruijn sequencesstream cipherD-homomorphismnonlinear feedback shift register sequences

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Cited In (11)

• Generation of full cycles by a composition of NLFSRs
• A recursive construction of nonbinary de Bruijn sequences
• A multiple stream generator based on de Bruijn digraph homomorphisms
• An efficient shift rule for the prefer-max de Bruijn sequence
• Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR
• Title not available (Why is that?)
• An efficient algorithm for generation of de Bruijn sequences over the ring \(F_2+uF_2\) by raising stage
• On extending de Bruijn sequences
• RRB vector: a practical general purpose immutable sequence
• Stretching de Bruijn sequences
• On ideal \(t\)-tuple distribution of filtering de Bruijn sequence generators

This page was built for publication: An efficient implementation of the D-homomorphism for generation of de Bruijn sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701385)