首页> 外文期刊>Journal of Combinatorial Theory, Series A >Euclidean and Hermitian self-dual MDS codes over large finite fields
【24h】

Euclidean and Hermitian self-dual MDS codes over large finite fields

机译:大有限域上的欧几里得和厄米自对偶MDS代码

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

摘要

The first author constructed new extremal binary self-dual codes (IEEE Trans. Inform. Theory 47 (2001) 386-393) and new self-dual codes over GF(4) with the highest known minimum weights (IEEE Trans. Inform. Theory 47 (2001) 1575-1580). The method used was to build self-dual codes from a given self-dual code of a smaller length. In this paper, we develop a complete generalization of this method for the Euclidean and Hermitian self-dual codes over finite fields GF(q). Using this method we construct many Euclidean and Hermitian self-dual MDS (or near MDS) codes of length up to 12 over various finite fields GF(q), where q = 8, 9, 16, 25, 32, 41, 49, 53, 64, 81, and 128. Our results on the minimum weights of (near) MDS self-dual codes over large fields give a better bound than the Pless-Pierce bound obtained from a modified Gilbert-Varshamov bound. (C) 2003 Elsevier Inc. All rights reserved. [References: 39]
机译:第一作者构造了新的极值二进制自对偶码(IEEE Trans。Inform。Theory 47(2001)386-393)和新的自对偶码在GF(4)上具有最高的已知最小权重(IEEE Trans。Inform。Theory) 47(2001)1575-1580)。所使用的方法是从较短长度的给定自对偶代码中构建自对偶代码。在本文中,我们针对有限域GF(q)上的欧几里得和埃尔米特自对偶代码开发了该方法的完整概括。使用此方法,我们构造了许多在各种有限域GF(q)上最长为12的欧几里得和厄米自对偶MDS(或接近MDS)代码,其中q = 8、9、16、25、32、41、49, 53、64、81和128。我们在大字段上(接近)MDS自对偶代码的最小权重的结果比从修改的Gilbert-Varshamov界获得的Pless-Pierce界更好。 (C)2003 Elsevier Inc.保留所有权利。 [参考:39]

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号