Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2411.03647 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909378999746560 |
|---|---|
| author | Temones, John Ben S. |
| author_facet | Temones, John Ben S. |
| contents | In this paper, we give a generalization on the error correcting capability of twisted centralizer codes obtained from a fixed rank 1 matrix. In particular, we fix the combinatorial matrix which is obtained by getting the linear combination of the matrix whose all entries are 1 and the identity matrix of order n. Results reveal that such codes have a dimension 1 for any fixed combinatorial matrix and constant a hence having a relatively low information rate due to the way its codewords are constructed, but are found to be maximum distance separable codes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_03647 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the Error-correcting Capability of Twisted Centralizer Codes Obtained from a Fixed Rank-1 Matrix Temones, John Ben S. Information Theory Coding theory In this paper, we give a generalization on the error correcting capability of twisted centralizer codes obtained from a fixed rank 1 matrix. In particular, we fix the combinatorial matrix which is obtained by getting the linear combination of the matrix whose all entries are 1 and the identity matrix of order n. Results reveal that such codes have a dimension 1 for any fixed combinatorial matrix and constant a hence having a relatively low information rate due to the way its codewords are constructed, but are found to be maximum distance separable codes. |
| title | On the Error-correcting Capability of Twisted Centralizer Codes Obtained from a Fixed Rank-1 Matrix |
| topic | Information Theory Coding theory |
| url | https://arxiv.org/abs/2411.03647 |