Palacio, Jane D.  <br/><br/>
On the minimum hamming distance of the pm-ary image of linear block codes over the finite chain ring Fpm + uFpm + ... + ur-1Fpm, ur = 0./ 
 Philippine Computing Journal  

 - vol. 7, 1 table, refs. 
 - vol. 7, no. 2 (December, 2012):43-46.  
<br/><br/> Let Fpm denote the finite field with pm elements where p is a prime. In this paper, linear block codes over Fpm are considered as images of linear block codes over the finite chain ring R(pm, r) = Fpm + uFpm + ... +ur-1Fpm, where ur + 0 and m, r E N. An Fpm linear map is defined from R (pm, r)n to Frnpm. Bounds on the minimum Hamming distance of the resultant codes are derived. These bounds largely depend on the minimum Hamming distance of the linear block code, the average value of the homogeneous weight on the residue field Fpm and the nilpotency index of the ring. A code meeting these bounds whose image is the extended binary Hamming code of order 3 is also given. 
<br/><br/><label>ISSN: </label>1908-1995 
<br/><br/><label>Subjects--Topical Terms: </label><br/>FINITE CHAIN RING.<br/> PM-ARY IMAGE. <br/>DISTANCE BOUNDS.
<br/><br/><label>Dewey Class. No.: </label>050/P17