A trace partitioned Gray code forq-ary generalized Fibonacci strings

DOI10.1080/09720529.2014.968360zbMATH Open1496.68140arXiv1308.3619OpenAlexW1626330442MaRDI QIDQ5069743FDOQ5069743

Authors:

Publication date: 19 April 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1308.3619

zbMATH Keywords

generalized Fibonacci numbersGray codespattern-avoiding strings

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Cites Work

• Title not available (Why is that?)
• Error detecting and error correcting codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Generating the N-ary Reflected Gray Codes
• The \(r\)-generalized Fibonacci numbers and polynomial coefficients
• Title not available (Why is that?)
• Gray codes for \(A\)-free strings

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Gray code orders for \(q\)-ary words avoiding a given factor
• Title not available (Why is that?)
• \(q\)-ary \((1, k)\)-overlap-free codes with given restrictions
• A Construction for Variable Dimension Strong Non-Overlapping Matrices

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)