Prefix partitioned gray codes for particular cross-bifix-free sets
| Affiliation auteurs | !!!! Error affiliation !!!! |
| Titre | Prefix partitioned gray codes for particular cross-bifix-free sets |
| Type de publication | Journal Article |
| Year of Publication | 2014 |
| Auteurs | Bernini A, Bilotta S, Pinzani R, Sabri A, Vajnovszki V |
| Journal | CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES |
| Volume | 6 |
| Pagination | 359-369 |
| Date Published | DEC |
| Type of Article | Article |
| ISSN | 1936-2447 |
| Mots-clés | CAT algorithms, Cross-bifix-free sets, Gray Codes, q-ary words |
| Résumé | 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. |
| DOI | 10.1007/s12095-014-0105-6 |