Maximality on Construction of Ternary Cross Bifix Free Code
ComTech: Computer, Mathematics and Engineering Applications · 30.06.2019 · 10 (1) · 23-27
DOI: 10.21512/comtech.v10i1.4716 ↗Kurz gefasst
Fachartikel in der Zeitschrift ComTech: Computer, Mathematics and Engineering Applications, online erschienen am 30.06.2019. Verfasst von Mohammad Affaf. Die Arbeit nennt 16 Literaturangaben.
Abstract (Originalsprache)
The purpose of this research was to show that ternary cross bifix free code CBFS3(2m+1) and CBFS3(2m+2) achieved the maximum for every natural number m. This research was a literature review. A cross bifix free codes was constructed by using Dyck path method which achieved the maximality, that was non-expandable on binary set sequences for appropriate length. This result is obtained by partitioning members of CBFS3(2m+1) and CBFS3(2m+2) and comparing them with the maximality of CBFS2(2m+1) and CBFS2(2m+2). For small length 3, the result also shows that the code CBFS3(3) is optimal.
Zitieren
APA
Affaf, M. (2019). Maximality on Construction of Ternary Cross Bifix Free Code. ComTech: Computer, Mathematics and Engineering Applications, 10(1), 23-27. https://doi.org/10.21512/comtech.v10i1.4716
Vancouver
Affaf M. Maximality on Construction of Ternary Cross Bifix Free Code. ComTech: Computer, Mathematics and Engineering Applications. 2019;10(1):23-27. doi:10.21512/comtech.v10i1.4716
BibTeX
@article{Affaf2019,
author = {Affaf, Mohammad},
title = {Maximality on Construction of Ternary Cross Bifix Free Code},
journal = {ComTech: Computer, Mathematics and Engineering Applications},
year = {2019},
volume = {10},
number = {1},
pages = {23--27},
doi = {10.21512/comtech.v10i1.4716}
}
EUVIMED