A set of words with the property that no prefix of any word is the suffix of any other word is called cross-bifix-free set. We provide an efficient generating algorithm producing Gray codes for a remarkable family of cross-bifix-free sets.
Prefix partitioned gray codes for particular cross-bifix-free sets / Antonio Bernini; Stefano Bilotta; Renzo Pinzani; Ahmad Sabri; Vincent Vajnovszki. - In: CRYPTOGRAPHY AND COMMUNICATIONS. - ISSN 1936-2447. - ELETTRONICO. - 6:(2014), pp. 359-369. [10.1007/s12095-014-0105-6]
Prefix partitioned gray codes for particular cross-bifix-free sets
BERNINI, ANTONIO;BILOTTA, STEFANO;PINZANI, RENZO;
2014
Abstract
A set of words with the property that no prefix of any word is the suffix of any other word is called cross-bifix-free set. We provide an efficient generating algorithm producing Gray codes for a remarkable family of cross-bifix-free sets.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
CCDS-D-14-00048_R1.pdf
Accesso chiuso
Descrizione: Articolo principale
Tipologia:
Versione finale referata (Postprint, Accepted manuscript)
Licenza:
Tutti i diritti riservati
Dimensione
816.41 kB
Formato
Adobe PDF
|
816.41 kB | Adobe PDF | Richiedi una copia |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
