Cross-Bifix-Free Codes Within a Constant Factor of Optimality
From MaRDI portal
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.
Cited in
(16)- Construction of some nonautomatic sequences by cellular automata
- A 2D non-overlapping code over a q-ary alphabet
- Unbordered pictures: properties and construction
- Cross-bifix-free sets generation via Motzkin paths
- Non-expandable non-overlapping sets of pictures
- Non-overlapping matrices via Dyck words
- Cross-bifix-free sets in two dimensions
- Sets of pictures avoiding overlaps
- scientific article; zbMATH DE number 7731171 (Why is no real title available?)
- In search of maximum non-overlapping codes
- \(q\)-ary \((1, k)\)-overlap-free codes with given restrictions
- On the maximum size of variable-length non-overlapping codes
- Two-dimensional q-ary non-overlapping codes
- On maximal almost balanced non-overlapping codes and non-overlapping codes with restricted run-lengths
- Constructions of two-dimensional non-overlapping codes
- Non-overlapping matrices
This page was built for publication: Cross-Bifix-Free Codes Within a Constant Factor of Optimality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346479)
