Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4656178 | Journal of Combinatorial Theory, Series A | 2008 | 16 Pages |
Abstract
We present an efficient method for constructing self-dual or self-orthogonal codes over finite rings Zpm (or Zm) with p an odd prime and m a positive integer. This is an extension of the previous work [J.-L. Kim, Y. Lee, Euclidean and Hermitian self-dual MDS codes over large finite fields, J. Combin. Theory Ser. A 105 (2004) 79–95] over large finite fields GF(pm) to finite rings Zpm (or Zm). Using this method we construct self-dual or self-orthogonal codes of length at least up to 10 over various finite rings Zpm or Zpq with q an odd prime, where pm=25, 125, 169, 289 and pq=65, 85. All the self-dual codes we obtained are MDS, MDR, near MDS, or near MDR codes.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics