Bibliographies thématiques / Cross-bifix-free set

Littérature scientifique sur le sujet « Cross-bifix-free set »

Auteur : Grafiati
Publié le 10 mars 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Sommaire

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Cross-bifix-free set ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Cross-bifix-free set"

1

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

Texte intégral
Résumé :
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.
Styles APA, Harvard, Vancouver, ISO, etc.
2

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

Texte intégral
Résumé :
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.
Styles APA, Harvard, Vancouver, ISO, etc.
3

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

Texte intégral
Résumé :
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.
Styles APA, Harvard, Vancouver, ISO, etc.
4

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

Texte intégral
Résumé :
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.
Styles APA, Harvard, Vancouver, ISO, etc.

Thèses sur le sujet "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.

Texte intégral
Résumé :
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.
Styles APA, Harvard, Vancouver, ISO, etc.
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie