Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/s12095-014-0105-6 | Cryptography and Communications |
Keywords | DocType | Volume |
Gray codes,Cross-bifix-free sets,CAT algorithms,q,-ary words,68R15,94B15,69P30 | Journal | 6 |
Issue | ISSN | Citations |
4 | 1936-2447 | 2 |
PageRank | References | Authors |
0.38 | 7 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Antonio Bernini | 1 | 34 | 7.68 |
| Stefano Bilotta | 2 | 32 | 9.62 |
| Renzo Pinzani | 3 | 341 | 67.45 |
| Ahmad Sabri | 4 | 7 | 2.09 |
| Vincent Vajnovszki | 5 | 170 | 24.12 |