Cross-Bifix-Free Codes Within a Constant Factor of Optimality
Information Theory
2013-03-12 v2 Combinatorics
math.IT
Abstract
A cross-bifix-free code is a set of words in which no prefix of any length of any word is the suffix of any word in the set. Cross-bifix-free codes arise in the study of distributed sequences for frame synchronization. We provide a new construction of cross-bifix-free codes which generalizes the construction in Bajic (2007) to longer code lengths and to any alphabet size. The codes are shown to be nearly optimal in size. We also establish new results on Fibonacci sequences, that are used in estimating the size of the cross-bifix-free codes.
Keywords
Cite
@article{arxiv.1209.0236,
title = {Cross-Bifix-Free Codes Within a Constant Factor of Optimality},
author = {Yeow Meng Chee and Han Mao Kiah and Punarbasu Purkayastha and Chengmin Wang},
journal= {arXiv preprint arXiv:1209.0236},
year = {2013}
}