A trace partitioned Gray code forq-ary generalized Fibonacci strings
From MaRDI portal
Publication:5069743
Abstract: We provide a trace partitioned Gray code for the set of q-ary strings avoiding a pattern constituted by k consecutive equal symbols. The definition of this Gray code is based on two different constructions, according to the parity of q. This result generalizes, and is based on, a Gray code for binary strings avoiding k consecutive 0's.
Cites work
- scientific article; zbMATH DE number 1665457 (Why is no real title available?)
- scientific article; zbMATH DE number 3916360 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 1354135 (Why is no real title available?)
- scientific article; zbMATH DE number 1792682 (Why is no real title available?)
- Error detecting and error correcting codes
- Gray codes for \(A\)-free strings
- On Generating the N-ary Reflected Gray Codes
- The \(r\)-generalized Fibonacci numbers and polynomial coefficients
Cited in
(6)- Restricting Dyck paths and 312-avoiding permutations
- A Construction for Variable Dimension Strong Non-Overlapping Matrices
- Lattice paths inside a table
- scientific article; zbMATH DE number 7734740 (Why is no real title available?)
- Gray code orders for \(q\)-ary words avoiding a given factor
- \(q\)-ary \((1, k)\)-overlap-free codes with given restrictions
This page was built for publication: A trace partitioned Gray code forq-ary generalized Fibonacci strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5069743)