首页> 外文会议>Iinternational conference on codes, cryptology, and information security >Repeated-Root Isodual Cyclic Codes over Finite Fields
【24h】

Repeated-Root Isodual Cyclic Codes over Finite Fields

机译:有限域上的重根等边循环码

获取原文

摘要

In this paper we give several constructions of cyclic codes over finite fields that are monomially equivalent to their dual, where the characteristic of the field divides the length of the code. These are called repeated-root cyclic isodual codes over finite fields. The constructions are based on the field characteristic, the generator polynomial and the length of the code.
机译:在本文中,我们给出了有限域上循环编码的几种构造,这些循环编码与它们的对偶单项等效,其中场的特征划分了编码的长度。这些被称为有限域上的重复根循环等值代码。构造基于场特性,生成多项式和代码长度。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号