首页> 外文期刊>Electronics Letters >Lower bound on minimum Lee distance of algebraic-geometric codes over finite fields
【24h】

Lower bound on minimum Lee distance of algebraic-geometric codes over finite fields

机译:有限域上代数几何代码的最小Lee距离的下限

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

摘要

Algebraic-geometric (AG) codes over finite fields with respect to the Lee metric have been studied. A lower bound on the minimum Lee distance is derived, which is a Lee-metric version of the well-known Goppa bound on the minimum Hamming distance of AG codes. The bound generalises a lower bound on the minimum Lee distance of Lee-metric BCH and Reed-Solomon codes, which have been successfully used for protecting against bitshift and synchronisation errors in constrained channels and for error control in partial-response channels.
机译:已经研究了关于Lee度量的有限域上的代数几何(AG)代码。得出最小Lee距离的下界,这是在AG码的最小汉明距离上界的著名Goppa的Lee度量版本。该界限概括了Lee-metric BCH和Reed-Solomon码的最小Lee距离的下限,这些最小距离已成功用于防止受限信道中的位偏移和同步错误以及部分响应信道中的错误控制。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号