Relevant bibliographies by topics / Bifix code

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters

Academic literature on the topic 'Bifix code'

Author: Grafiati
Published: 6 September 2023
Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Bifix code.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Bifix code"

1

BERNINI, ANTONIO, STEFANO BILOTTA, RENZO PINZANI, and VINCENT VAJNOVSZKI. "A Gray code for cross-bifix-free sets." Mathematical Structures in Computer Science 27, no. 2 (2015): 184–96. http://dx.doi.org/10.1017/s0960129515000067.

Full text
Abstract:
A cross-bifix-free set of words is a set in which no prefix of any length of any word is the suffix of any other word in the set. A construction of cross-bifix-free sets has recently been proposed in Cheeet al.(2013) within a constant factor of optimality. We propose a Gray code for these cross-bifix-free sets and a CAT algorithm generating it. Our Gray code list is trace partitioned, that is, words with zero in the same positions are consecutive in the list.
APA, Harvard, Vancouver, ISO, and other styles
2

Kunimochi, Yoshiyuki. "Some Properties of Extractable Codes and Insertable Codes." International Journal of Foundations of Computer Science 27, no. 03 (2016): 327–42. http://dx.doi.org/10.1142/s0129054116400128.

Full text
Abstract:
This paper deals with insertability and mainly extractablity of codes. A code C is called insertable (or extractable) if the free submonoid C* generated by C satisfies if z, [Formula: see text] implies [Formula: see text] (or z, [Formula: see text] implies [Formula: see text]). We show that a finite insertable code is a full uniform code. On the other hand there are many finite extractable codes which are not full uniform codes. We cannot still characterize the structures of infinite extractable codes. Here we give some results on the class of infix extractable codes. First, we consider a nece
APA, Harvard, Vancouver, ISO, and other styles
3

Affaf, Mohammad. "Maximality on Construction of Ternary Cross Bifix Free Code." ComTech: Computer, Mathematics and Engineering Applications 10, no. 1 (2019): 23. http://dx.doi.org/10.21512/comtech.v10i1.4716.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
4

PERRIN, DOMINIQUE. "COMPLETELY REDUCIBLE SETS." International Journal of Algebra and Computation 23, no. 04 (2013): 915–41. http://dx.doi.org/10.1142/s0218196713400158.

Full text
Abstract:
We study the family of rational sets of words, called completely reducible and which are such that the syntactic representation of their characteristic series is completely reducible. This family contains, by a result of Reutenauer, the submonoids generated by bifix codes and, by a result of Berstel and Reutenauer, the cyclic sets. We study the closure properties of this family. We prove a result on linear representations of monoids which gives a generalization of the result concerning the complete reducibility of the submonoid generated by a bifix code to sets called birecurrent. We also give
APA, Harvard, Vancouver, ISO, and other styles
5

PRIBAVKINA, ELENA, and EMANUELE RODARO. "STATE COMPLEXITY OF CODE OPERATORS." International Journal of Foundations of Computer Science 22, no. 07 (2011): 1669–81. http://dx.doi.org/10.1142/s0129054111008957.

Full text
Abstract:
We consider five operators on a regular language. Each of them is a tool for constructing a code (respectively prefix, suffix, bifix, infix) and a hypercode out of a given regular language. We give the precise values of the (deterministic) state complexity of these operators: over a constant-size alphabet for the first four of them and over a quadratic-size alphabet for the hypercode operator.
APA, Harvard, Vancouver, ISO, and other styles
6

Almeida, Jorge, Alfredo Costa, Revekka Kyriakoglou, and Dominique Perrin. "On the group of a rational maximal bifix code." Forum Mathematicum 32, no. 3 (2020): 553–76. http://dx.doi.org/10.1515/forum-2018-0270.

Full text
Abstract:
AbstractWe give necessary and sufficient conditions for the group of a rational maximal bifix code Z to be isomorphic with the F-group of {Z\cap F}, when F is recurrent and {Z\cap F} is rational. The case where F is uniformly recurrent, which is known to imply the finiteness of {Z\cap F}, receives special attention. The proofs are done by exploring the connections with the structure of the free profinite monoid over the alphabet of F.
APA, Harvard, Vancouver, ISO, and other styles
7

Bruyère, Véronique, and Dominique Perrin. "Maximal bifix codes." Theoretical Computer Science 218, no. 1 (1999): 107–21. http://dx.doi.org/10.1016/s0304-3975(98)00253-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Affaf, Moh, and Zaiful Ulum. "KONSTRUKSI KODE CROSS BIFIX BEBAS TERNAIR BERPANJANG GENAP UNTUK MENGATASI MASALAH SINKRONISASI FRAME." JIKO (Jurnal Informatika dan Komputer) 2, no. 2 (2017): 109. http://dx.doi.org/10.26798/jiko.2017.v2i2.69.

Full text
Abstract:
In order to guarantee the synchronization between a transmited data by transmitter and received data by receiver can be done by periodically inserting a fixed sequence into the transmited data. It is one of the main topic in digital communication systems which called Frame Synchronization. Study of Cross Bifix Free Codes arise to solve Synchronization’s problem via distributed sequence’s method which introducted first in 2000. A Cross Bifix Free Codes is a set of sequences in which no prefix of any length of less than to of any sequences is the sufix of any sequence in the set. In 2012, a Bina
APA, Harvard, Vancouver, ISO, and other styles
9

Li, Zheng-Zhu, H. J. Shyr, and Y. S. Tsai. "Annihilators of bifix codes." International Journal of Computer Mathematics 83, no. 1 (2006): 81–99. http://dx.doi.org/10.1080/00207160500112910.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Li, Zheng-Zhu, and Y. S. Tsai. "Classifications of bifix codes." International Journal of Computer Mathematics 87, no. 12 (2010): 2625–43. http://dx.doi.org/10.1080/00207160902927055.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Bifix code"

1

Dolce, Francesco. "Codes bifixes, combinatoire des mots et systèmes dynamiques symboliques." Thesis, Paris Est, 2016. http://www.theses.fr/2016PESC1036/document.

Full text
Abstract:
L'étude des ensembles de mots complexité linéaire joue un rôle très important dans la théorie de combinatoire des mots et dans la théorie des systèmes dynamiques symboliques.Cette famille d'ensembles comprend les ensembles de facteurs : d'un mot Sturmien ou d'un mot d'Arnoux-Rauzy, d'un codage d'échange d'intervalle, d'un point fixe d'un morphisme primitif, etc.L'enjeu principal de cette thèse est l'étude de systèmes dynamiques minimales, définis de façon équivalente comme ensembles factoriels de mots uniformément récurrents.Comme résultat principal nous considérons une hiérarchie naturelle de
APA, Harvard, Vancouver, ISO, and other styles
2

Shivkumar, K. M. "On Some Questions Involving Prefix Codes." Thesis, 2018. https://etd.iisc.ac.in/handle/2005/4719.

Full text
Abstract:
Let A be a finite alphabet and A be the set of all finite sequences of the elements of A. A word is any member of A . A prefix code X is a set of words satisfying the prefix property, i.e., no word in the set is a prefix of any other word in the set. If X is defined as the collection of all concatenations of the words of X, then it can be seen that each of its elements can be expressed as a concatenation of the words of X in a unique manner. Any subset of A possessing this property is called a uniquely decodable code and the prefix codes constitute an important subclass of uniquely dec
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Zheng-Zhu, and 李正竹. "Classifications of Bifix Codes." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/wws7bf.

Full text
Abstract:
博士<br>中原大學<br>應用數學研究所<br>93<br>Bifix codes are the most important and useful codes in the whole code theory. In this dissertation we investigate the classifications of bifix codes. We split the family of bifix codes into several subfamilies, namely the strict intercode of index $m$ where $m geq 0$, denoted by $B_m(X)$. We study some combinatorial properties of these languages in $B_m(X)$. We also study the properties of annihilators of a given bifix code. For a bifix code $L$, we constructs several methods to determine the index $m$ such that $L$ is a strict intercode of index $m$. Especially
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Bifix code"

1

Almeida, Jorge, Alfredo Costa, Revekka Kyriakoglou, and Dominique Perrin. "Groups of Bifix Codes." In Profinite Semigroups and Symbolic Dynamics. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-55215-2_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Dolce, Francesco, and Dominique Perrin. "Return Words and Bifix Codes in Eventually Dendric Sets." In Lecture Notes in Computer Science. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-28796-2_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Bifix code' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography