Abstract | ||
---|---|---|
AbstractWe 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. |
Year | DOI | Venue |
---|---|---|
2018 | 10.1007/s12095-017-0251-8 | Periodicals |
Keywords | DocType | Volume |
Bidimensional codes,Non-overlapping matrices,Restricted words | Journal | 10 |
Issue | ISSN | Citations |
4 | 1936-2447 | 2 |
PageRank | References | Authors |
0.38 | 0 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Elena Barcucci | 1 | 306 | 59.66 |
Antonio Bernini | 2 | 34 | 7.68 |
Stefano Bilotta | 3 | 32 | 9.62 |
Renzo Pinzani | 4 | 341 | 67.45 |