Name
Abstract | ||
|---|---|---|
Cross-bifix-free sets are sets of words such that no prefix of any word is a suffix of any other word. In this paper, we introduce a general constructive method for the sets of cross-bifix-free binary words of fixed length. It enables us to determine a cross-bifix-free words subset which has the property to be non-expandable. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/TIT.2012.2189479 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
indexes,lattices,indexation,set theory,switches,binary sequence,algorithms,synchronization | Journal | 58 |
Issue | ISSN | Citations |
6 | 0018-9448 | 10 |
PageRank | References | Authors |
0.76 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stefano Bilotta | 1 | 32 | 9.62 |
| Elisa Pergola | 2 | 149 | 18.60 |
| Renzo Pinzani | 3 | 341 | 67.45 |