We define a set of matrices over a finite alphabet where all possible overlaps between any two matrices are forbidden. The set is also enumerated by providing some recurrences counting particular classes of restricted words. Moreover, we analyze the asymptotic cardinality of the set according to the parameters related to the construction of the matrices.

A 2D non-overlapping code over a q-ary alphabet / Barcucci, Elena; Bernini, Antonio; Bilotta, Stefano; Pinzani, Renzo. - In: CRYPTOGRAPHY AND COMMUNICATIONS. - ISSN 1936-2447. - STAMPA. - 10:(2018), pp. 667-683. [10.1007/s12095-017-0251-8]

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

Elena Barcucci;Antonio Bernini;Stefano Bilotta;Renzo Pinzani
2018

Abstract

We define a set of matrices over a finite alphabet where all possible overlaps between any two matrices are forbidden. The set is also enumerated by providing some recurrences counting particular classes of restricted words. Moreover, we analyze the asymptotic cardinality of the set according to the parameters related to the construction of the matrices.
2018
10
667
683
Barcucci, Elena; Bernini, Antonio; Bilotta, Stefano; Pinzani, Renzo
File in questo prodotto:
File Dimensione Formato  
2DqCodeCRYPTO_revised.pdf

accesso aperto

Descrizione: versione referata
Tipologia: Versione finale referata (Postprint, Accepted manuscript)
Licenza: Tutti i diritti riservati
Dimensione 477.14 kB
Formato Adobe PDF
477.14 kB Adobe PDF
A2DNon-overlappingCodeOverAQ-a.pdf

Accesso chiuso

Descrizione: Articolo principale
Tipologia: Pdf editoriale (Version of record)
Licenza: Tutti i diritti riservati
Dimensione 744.76 kB
Formato Adobe PDF
744.76 kB Adobe PDF   Richiedi una copia

I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/1103803
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 6
  • ???jsp.display-item.citation.isi??? 4
social impact