Hamming and Symbol-Pair Distances of Constacyclic Codes of Length $2p^s$ over $\frac{\mathbb{F}_{p^m}[u, v]}{\langle u^2, v^2, uv-vu\rangle}$
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912294377619456 |
|---|---|
| author | Acharya, Divya Poojary, Prasanna R, Vadiraja Bhatta G |
| author_facet | Acharya, Divya Poojary, Prasanna R, Vadiraja Bhatta G |
| contents | Let $p$ be an odd prime. In this paper, we have determined the Hamming distances for constacyclic codes of length $2p^s$ over the finite commutative non-chain ring $\mathcal{R}=\frac{\mathbb{F}_{p^m}[u, v]}{\langle u^2, v^2, uv-vu\rangle}$. Also their symbol-pair distances are completely obtained. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_16043 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Hamming and Symbol-Pair Distances of Constacyclic Codes of Length $2p^s$ over $\frac{\mathbb{F}_{p^m}[u, v]}{\langle u^2, v^2, uv-vu\rangle}$ Acharya, Divya Poojary, Prasanna R, Vadiraja Bhatta G Information Theory Combinatorics 11T71, 14G50 Let $p$ be an odd prime. In this paper, we have determined the Hamming distances for constacyclic codes of length $2p^s$ over the finite commutative non-chain ring $\mathcal{R}=\frac{\mathbb{F}_{p^m}[u, v]}{\langle u^2, v^2, uv-vu\rangle}$. Also their symbol-pair distances are completely obtained. |
| title | Hamming and Symbol-Pair Distances of Constacyclic Codes of Length $2p^s$ over $\frac{\mathbb{F}_{p^m}[u, v]}{\langle u^2, v^2, uv-vu\rangle}$ |
| topic | Information Theory Combinatorics 11T71, 14G50 |
| url | https://arxiv.org/abs/2412.16043 |