Orientable sequences over non-binary alphabets
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 721894 (Why is no real title available?)
- scientific article; zbMATH DE number 721897 (Why is no real title available?)
- scientific article; zbMATH DE number 3422259 (Why is no real title available?)
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- A method for constructing decodable de Bruijn sequences
- A recursive construction of nonbinary de Bruijn sequences
- Arbitrary-length analogs to de Bruijn sequences
- Binary robust positioning patterns with low redundancy and efficient locating algorithms
- Constructing Orientable Sequences
- Efficient construction of long orientable sequences
- Feedback shift registers
- On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
- Research problems on Gray codes and universal cycles
- Robust positioning patterns
- Robust positioning patterns with low redundancy
- Simple and Robust Binary Self-Location Patterns
- Universal cycles for combinatorial structures
Cited in
(4)
This page was built for publication: Orientable sequences over non-binary alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7026766)