100元2小时不限次数电话号码,全国空降200元快餐联系方式,24小时微信快餐妹,全国同城约资源匹配系统

Research
Events and Seminars
location: English > Research > Events and Seminars > 正文

On some classes of repeated-root constacyclic codes of prime power length over Galois rings

Time:2013-05-17  Author:  ClickTimes:
TitleOn some classes of repeated-root constacyclic codes of prime power length over Galois rings
SpeakerProfessor Hai Q. Dinh Kent State University, USA
Date/Time2013年5月23日上午10:00-10:50
Place六号楼二楼报告厅
Abstract
Brief Introduction to Speaker

We discuss cyclic and negacyclic codes of length $p^s$ over Galois ring $GR(p^a,m)$. The ambient rings for those codes are chain rings if and only if the codes are negacyclic and $p=2$. In this case, complete structure and Hamming distances of all such negacyclic codes are established. For all other cases, it is shown that the ambient rings are local ring with the non-principal maximal ideal generated by $2$ elements. We establish the nilpotency indexes of such 2 elements in the more general setting where the alphabet is any finite chain ring.