Symbol-Pair Distances of Negacyclic Codes of Length $2^s$ over $\GR(2^a,m)$
Abstract
We deal with the general case of Galois ring $\GR(2^a,m)$, for any $a$. Similar to the case $a=1$, negacyclic codes of length $2^s$ over $\GR(2^a,m)$ form a chain as ideals $\langle(x+1)^i\rangle$, $0 \leq i \leq 2^sa$, of the chain ring.
Keywords:
Negacyclic codes, Constacyclic codes, Galois ring, Symbol-Pair Distances
Status
Graduate
Department
Mathematics
College
College of Arts and Sciences
Campus
Athens
Faculty Mentor
Lopez-Permouth, Sergio
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Symbol-Pair Distances of Negacyclic Codes of Length $2^s$ over $\GR(2^a,m)$
We deal with the general case of Galois ring $\GR(2^a,m)$, for any $a$. Similar to the case $a=1$, negacyclic codes of length $2^s$ over $\GR(2^a,m)$ form a chain as ideals $\langle(x+1)^i\rangle$, $0 \leq i \leq 2^sa$, of the chain ring.