Prefix partitioned gray codes for particular cross-bifix-free sets

Bernini, Antonio; Bilotta, Stefano; Pinzani, Renzo; Sabri, Ahmad Zaharuddin Sani Ahmad; Vajnovszki, Vincent

doi:10.1007/s12095-014-0105-6

Cited by 20 publications

(15 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The first one is presented in [3] and it is a Gray code, denoted by S q n , for the cross-bifix-free set of words S q n . In this section, we use it for the main diagonals of the matrices in CBBF q n .…”

Section: A Gray Code For Cbbf Q Nmentioning

confidence: 99%

Cross-bifix-free sets in two dimensions

Barcucci

Bernini

Bilotta

et al. 2017

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

A bidimensional bifix (in short bibifix ) of a square matrix T is a square submatrix of T which occurs in the top-left and bottomright corners of T . This allows us to extend the definition of bifix-free words and cross-bifix-free set of words to bidimensional structures. In this paper we exhaustively generate all the bibifix -free square matrices and we construct a particular non-expandable cross-bibifix -free set of square matrices. Moreover, we provide a Gray code for listing this set.

show abstract

Section: A Gray Code For Cbbf Q Nmentioning

confidence: 99%

Cross-bifix-free sets in two dimensions

Barcucci

Bernini

Bilotta

et al. 2017

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Surely, these hypotheses lead to a very special case and they are very restrictive. Nevertheless, such sets of square matrices have at least two notable properties: the matrices can be listed in a 1-Gray code sense (by using the Gray code defined in [9] and the well-known generalization [19] of the Binary Reflected Gray Code [21]) and the sets are non-expandable. As far as the 1-Gray code (which is a list of the matrices of the set in a such way that two consecutive matrices differ only for one entry) is concerned, we observe that S (k,p) m×n,q is not a 1-Gray code.…”

Section: Further Developmentsmentioning

confidence: 99%

A 2D non-overlapping code over a q-ary alphabet

et al. 2017

Self Cite

View full text Add to dashboard Cite

show abstract

“…Kode ini diklaim menghasilkan kode yang optimal saat panjang katakodenya, yaitu , membagi banyaknya simbol, yaitu . Selain dari [7][8][9][10][11] di atas, konstruksi Kode Cross Bifix Bebas juga diangkat/dibahas dalam [12][13][14] II. METODE Pada bagian ini akan dijelaskan mengenai beberapa definisi dan istilah dalam teori koding yang terkait dengan kode cross bifix bebas.…”

Section: Pendahuluanunclassified