De Bruijn sequences, irreducible codes and cyclotomy

DOI10.1016/0012-365X(96)00106-9zbMATH Open0878.94046OpenAlexW2007799433MaRDI QIDQ1126191FDOQ1126191

Authors: Erik R. Hauge, Tor Helleseth 

Publication date: 16 November 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(96)00106-9

Recommendations

• The adjacency matrix of some class of irreducible polynomials
• Algorithms for the generation of full-length shift- register sequences
• On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
• Clues to the hidden nature of de Bruijn sequences
• Characterizations of generators for modified de Bruijn sequences

zbMATH Keywords

de Bruijn sequencesirreducible polynomialscyclotomic numbersadjacency graphsfeedback functions

Mathematics Subject Classification ID

Applications of graph theory (05C90) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Cites Work

• Title not available (Why is that?)
• Weights of irreducible cyclic codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• On the classification of deBruijn sequences
• An efficient algorithm for the generation of DeBruijn cycles

Cited In (16)

• Characterizations of generators for modified de Bruijn sequences
• On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
• The minimal polynomials of modified de Bruijn sequences revisited
• New results on the minimal polynomials of modified de Bruijn sequences
• Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR
• Minimum Eulerian circuits and minimum de Bruijn sequences
• Cryptographically Strong de Bruijn Sequences with Large Periods
• The adjacency matrix of some class of irreducible polynomials
• New generalized cyclotomy and its applications
• The adjacency graphs of FSRs with a class of affine characteristic functions
• On cyclotomic generator of order \(r\).
• The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields
• Properties of the cycles that contain all vectors of weight \(\le k\)
• Generalized cycle joining method and its application to the construction of long-period Galois NFSRs
• Canonical form of the universal circuits matrix of feedback functions.
• Construction of de Bruijn sequences from product of two irreducible polynomials

This page was built for publication: De Bruijn sequences, irreducible codes and cyclotomy

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