Relevant bibliographies by topics / Cross-bifix-free set

Academic literature on the topic 'Cross-bifix-free set'

Author: Grafiati
Published: 10 March 2023

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

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Cross-bifix-free set.'

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 "Cross-bifix-free set"

1

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 (October 12, 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 Binary Cross Bifix Free Codes was constructed by using Dyck path. In 2017, a Ternary Cross Bifix Free Codes with odd lenght was constructed, , by generalize the construction of binary cross bifix free. In this paper, will be constructed Ternary Cross Bifix Free Codes for even length, , by expand the construction of Binary Cross Bifix Free Codes.
APA, Harvard, Vancouver, ISO, and other styles
2

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 (May 11, 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
3

Affaf, Mohammad. "Maximality on Construction of Ternary Cross Bifix Free Code." ComTech: Computer, Mathematics and Engineering Applications 10, no. 1 (June 30, 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

Bernini, Antonio, Stefano Bilotta, Elisa Pergola, and Renzo Pinzani. "A generating function for bit strings with no Grand Dyck pattern matching." Pure Mathematics and Applications 25, no. 1 (September 1, 2015): 30–44. http://dx.doi.org/10.1515/puma-2015-0003.

Full text
Abstract:
Abstract We study the construction and the enumeration of bit strings, or binary words in {0, 1}*, having more 1’s than 0’s and avoiding a set of Grand Dyck patterns which form a cross-bifix-free set. We give a particular jumping and marked succession rule which describes the growth of such words according to the number of 1’s. Then, we give the enumeration of the class by means of generating function.
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Cross-bifix-free set"

1

BILOTTA, STEFANO. "Pattern avoiding words and cross-bifix-free sets: a general approach." Doctoral thesis, 2013. http://hdl.handle.net/2158/804481.

Full text
Abstract:
In this thesis we determine an algorithmic unified approach, based on the concept of succession rule, for the construction and the enumeration, according to the number of ones, of binary words in {0, 1} having the number of 1’s greater than or equal to the number of 0’s, and which can be applied to any forbidden pattern. Moreover, we extend this approach to the class of binary words in {0, 1} having the number of 1’s greater than or equal to the number of 0’s, and avoiding a set of forbidden patterns. In the second line of research, succession rules are studied posing a specific relevance on their relationships with recurrence relations.
APA, Harvard, Vancouver, ISO, and other styles
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