Ranks of Checkered Pattern Matrices with Applications to Information Embedding and Retrieving
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915502657372160 |
|---|---|
| author | Hirose, Hideo |
| author_facet | Hirose, Hideo |
| contents | Checkered patterns are characterized by their square structure and the use of only two distinct colors. These colors are typically represented by two types of numerical sets: {1,0} and {1,-1}. Matrices based on {1,0} may seem identical to those based on {1,-1} when forming checkered patterns because the only difference is that the numbers 0 are changed to -1. However, these two kinds of matrices are completely different in a mathematical sense because a matrix using {1,0} has a rank of 2 and a matrix using {1,-1} has a rank of 1. Knowing this difference in advance allows us to reduce the computational effort required for matrix operations such as information embedding and retrieving. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_15605 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Ranks of Checkered Pattern Matrices with Applications to Information Embedding and Retrieving Hirose, Hideo History and Overview Information Theory Checkered patterns are characterized by their square structure and the use of only two distinct colors. These colors are typically represented by two types of numerical sets: {1,0} and {1,-1}. Matrices based on {1,0} may seem identical to those based on {1,-1} when forming checkered patterns because the only difference is that the numbers 0 are changed to -1. However, these two kinds of matrices are completely different in a mathematical sense because a matrix using {1,0} has a rank of 2 and a matrix using {1,-1} has a rank of 1. Knowing this difference in advance allows us to reduce the computational effort required for matrix operations such as information embedding and retrieving. |
| title | Ranks of Checkered Pattern Matrices with Applications to Information Embedding and Retrieving |
| topic | History and Overview Information Theory |
| url | https://arxiv.org/abs/2509.15605 |