A simple suboptimal construction of cross-bifix-free codes

Cross-Bifix-Free Codes Within a Constant Factor of Optimality

“…This specific construction uncovers interesting connections to the Fibonacci sequence of numbers. In particular, the number of binary words of length , for which are cross-bifix-free satisfies the Fibonacci recursion It is noted in [3] that although this construction gives larger sets compared to distributed sequences [14] for , the sizes of the sets are relatively smaller for lengths greater than eight. In a recent work, Bilotta et al [4] introduced a new construction of binary cross-bifix-free codes based on lattice paths and showed that their construction attains greater cardinality compared to the ones in [3].…”

“…In the above example of a distributed sequence, the set of words forms a cross-bifix-free code. In a follow up work, Bajic [3] provided a new construction of cross-bifix-free codes over a binary alphabet for word lengths up to eight. This specific construction uncovers interesting connections to the Fibonacci sequence of numbers.…”

“…In this study, we revisit the construction in [3]. We give a new construction of cross-bifix-free codes that generalizes the construction of [3] in two ways.…”

Konstruksi Kode Cross Bifix Bebas Ternair Berpanjang Genap Untuk Mengatasi Masalah Sinkronisasi Frame

“…F Para peneliti mengusulkan beberapa cara untuk mengontruksi kode tersebut. Pertama [7], yang mengkontruksi kode tersebut dengan menggunakan metode yang disebut Kernel Set. Kemudian, pada 2012 diperkenalkan kontruksi kode cross bifix bebas dengan panjang sebarang [8].…”

“…Kode ini diklaim menghasilkan kode yang optimal saat panjang katakodenya, yaitu , membagi banyaknya simbol, yaitu . Selain dari [7][8][9][10][11] di atas, konstruksi Kode Cross Bifix Bebas juga diangkat/dibahas dalam [12][13][14] II. METODE Pada bagian ini akan dijelaskan mengenai beberapa definisi dan istilah dalam teori koding yang terkait dengan kode cross bifix bebas.…”