A Gray Code for cross-bifix-free sets
Information Theory
2015-05-20 v1 Discrete Mathematics
Combinatorics
math.IT
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 by Chee {\it et al.} in 2013 within a constant factor of optimality. We propose a \emph{trace partitioned} Gray code for these cross-bifix-free sets and a CAT algorithm generating it.
Cite
@article{arxiv.1401.4650,
title = {A Gray Code for cross-bifix-free sets},
author = {Antonio Bernini and Stefano Bilotta and Renzo Pinzani and Vincent Vajnovszki},
journal= {arXiv preprint arXiv:1401.4650},
year = {2015}
}