首页> 外文会议>2012 IEEE International Symposium on Information Theory Proceedings >Self-dual repeated root cyclic and negacyclic codes over finite fields
【24h】

Self-dual repeated root cyclic and negacyclic codes over finite fields

机译:有限域上的自对偶重复根循环和负循环码

获取原文
获取原文并翻译 | 示例

摘要

In this paper we investigate repeated root cyclic and negacyclic codes of length pr m over Fps with (m, p) = 1. In the case p odd, we give necessary and sufficient conditions on the existence of negacyclic self-dual codes. When m = 2m'' with m'' odd, we characterize the codes in terms of their generator polynomials. This provides simple conditions on the existence of self-dual negacyclic codes, and generalizes the results of Dinh [6]. We also answer an open problem concerning the number of self-dual cyclic codes given by Jia et al. [11].
机译:在本文中,我们研究了Fps上长度为p r m的重复根循环码和负循环码,其中(m,p)=1。在p奇数的情况下,我们给出了存在条件的充要条件负自对偶码。当m = 2m ''且m ''为奇数时,我们根据代码的生成多项式来表征代码。这为存在自对偶的负循环码提供了简单的条件,并推广了Dinh的结果[6]。我们还回答了一个有关贾等人给出的自对偶循环码数的开放问题。 [11]。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号