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.
A trace partitioned Gray code forq-ary generalized Fibonacci strings / Bernini, A.; Bilotta, S.; Pinzani, R.; Vajnovszki, V.. - In: JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY. - ISSN 0972-0529. - STAMPA. - 18:(2015), pp. 751-761. [10.1080/09720529.2014.968360]
A trace partitioned Gray code forq-ary generalized Fibonacci strings
BERNINI, ANTONIO;BILOTTA, STEFANO;PINZANI, RENZO;
2015
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.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
JDMSC-T-211.pdf
Accesso chiuso
Tipologia:
Versione finale referata (Postprint, Accepted manuscript)
Licenza:
Tutti i diritti riservati
Dimensione
380.39 kB
Formato
Adobe PDF
|
380.39 kB | Adobe PDF | Richiedi una copia |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.