Back to Search
Start Over
On constacyclic codes of length 9ps over pm and their optimal codes.
- Source :
-
Journal of Algebra & Its Applications . Jul2024, Vol. 23 Issue 8, p1-42. 42p. - Publication Year :
- 2024
-
Abstract
- The problem of classifying constacyclic codes over a finite field, both the Hamming distance and the algebraic structure, is an interesting problem in algebraic coding theory. For the repeated-root constacyclic codes of length n p s over p m , where p is a prime number and p does not divide n , the problem has been solved completely for all n ≤ 6 and partially for n = 7 , 8. In this paper, we solve the problem for n = 9 and all primes p different from 3 and 1 9. In particular, we characterize the Hamming distance of all repeated-root constacyclic codes of length 9 p s over p m . As an application, we identify all optimal and near-optimal codes with respect to the Singleton bound of these types, namely, MDS, almost-MDS, and near-MDS codes. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 02194988
- Volume :
- 23
- Issue :
- 8
- Database :
- Academic Search Index
- Journal :
- Journal of Algebra & Its Applications
- Publication Type :
- Academic Journal
- Accession number :
- 178020475
- Full Text :
- https://doi.org/10.1142/S0219498825500768