Name
Abstract | ||
|---|---|---|
A cross-bifix-free set of words is a set in which no prefix of any length of any word is the suffix of any other word in the set. A construction of cross-bifix-free sets has recently been proposed in Chee et al. (2013) within a constant factor of optimality. We propose a Gray code for these cross-bifix-free sets and a CAT algorithm generating it. Our Gray code list is trace partitioned, that is, words with zero in the same positions are consecutive in the list. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1017/S0960129515000067 | MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Disjoint sets,Self-synchronizing code,Suffix,Gray code,Prefix,Prefix code,Mathematics | Journal | 27 |
Issue | ISSN | Citations |
SP2 | 0960-1295 | 2 |
PageRank | References | Authors |
0.38 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Antonio Bernini | 1 | 34 | 7.68 |
| Stefano Bilotta | 2 | 32 | 9.62 |
| Renzo Pinzani | 3 | 341 | 67.45 |
| Vincent Vajnovszki | 4 | 170 | 24.12 |