KONSTRUKSI KODE CROSS BIFIX BEBAS TERNAIR BERPANJANG GENAP UNTUK MENGATASI MASALAH SINKRONISASI FRAME

In order to guarantee the synchronization between a transmited data by a transmitter and received data by the receiver can be done by periodically inserting a fixed sequence into the transmited data. It is one of the main topics in digital communication systems which called Frame Synchronization. Study of Cross Bifix Free Codes arises to solve Synchronization’s problem via distributed sequence’s method which introduced by Wigngardeen and Willink in 2000. A Cross Bifix Free Codes is a set of sequences in which no prefix of any length of less than to n of any sequences is the suffix of any sequence in the set. In 2012, Bilotta et al construct binary cross bifix free codes by using Dyck path. In 2017, Affaf et al was construct cross bifix free codes, 〖CBFS〗_3 (2m+1), by generalizing Bilotta’s construction. In this paper, will be constructed Ternary Cross Bifix Free Codes for even length, 〖CBFS〗_3 (2m+2), by using Bilotta and Affaf’s construction.(this paper has been submitted and still on review process in Jurnal Informatika dan Komputer (JIKO) at 16 August 2017)