Computing efficiently a parity-check matrix for Zps-additive codes
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913191544487936 |
|---|---|
| author | Fernández-Córdoba, Cristina Torres, Adrián Vela, Carlos Villanueva, Mercè |
| author_facet | Fernández-Córdoba, Cristina Torres, Adrián Vela, Carlos Villanueva, Mercè |
| contents | The Zps-additive codes of length n are subgroups of Zps^n , and can be seen as a generalization of linear codes over Z2, Z4, or more general over Z2s . In this paper, we show two methods for computing a parity-check matrix of a Zps-additive code from a generator matrix of the code in standard form. We also compare the performance of our results implemented in Magma with the current available function in Magma for codes over finite rings in general. A time complexity analysis is also shown. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_05247 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Computing efficiently a parity-check matrix for Zps-additive codes Fernández-Córdoba, Cristina Torres, Adrián Vela, Carlos Villanueva, Mercè Information Theory The Zps-additive codes of length n are subgroups of Zps^n , and can be seen as a generalization of linear codes over Z2, Z4, or more general over Z2s . In this paper, we show two methods for computing a parity-check matrix of a Zps-additive code from a generator matrix of the code in standard form. We also compare the performance of our results implemented in Magma with the current available function in Magma for codes over finite rings in general. A time complexity analysis is also shown. |
| title | Computing efficiently a parity-check matrix for Zps-additive codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2401.05247 |