MDS codes over finite principal ideal rings

Citations

WEB OF SCIENCE

43
Citations

SCOPUS

49

초록

The purpose of this paper is to study codes over finite principal ideal rings. To do this, we begin with codes over finite chain rings as a natural generalization of codes over Galois rings GR( p(e), l) ( including Z(pe)). We give sufficient conditions on the existence of MDS codes over finite chain rings and on the existence of self-dual codes over finite chain rings. We also construct MDS self-dual codes over Galois rings GF( 2(e), l) of length n = 2(l) for any a >= 1 and l >= 2. Torsion codes over residue fields of finite chain rings are introduced, and some of their properties are derived. Finally, we describe MDS codes and self-dual codes over finite principal ideal rings by examining codes over their component chain rings, via a generalized Chinese remainder theorem.

키워드

Chain ringGalois ringMDS codePrincipal ideal ringLINEAR CODESZM
제목
MDS codes over finite principal ideal rings
저자
Dougherty, Steven T.Kim, Jon-LarkKulosman, Hamid
DOI
10.1007/s10623-008-9215-5
발행일
2009-01
유형
Article
저널명
Designs, Codes, and Cryptography
50
1
페이지
77 ~ 92