...
首页> 外文期刊>Designs, Codes and Crytography >Error and erasure correcting algorithms for rank codes
【24h】

Error and erasure correcting algorithms for rank codes

机译:等级码的纠错和纠错算法

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

摘要

In this paper, transmitted signals are considered as square matrices of the Maximum rank distance (MRD) (n, k, d)-codes. A new composed decoding algorithm is proposed to correct simultaneously rank errors and rank erasures. If the rank of errors and erasures is not greater than the Singleton bound, then the algorithm gives always the correct decision. If it is not a case, then the algorithm gives still the correct solution in many cases but some times the unique solution may not exist.
机译:在本文中,传输的信号被视为最大秩距离(MRD)(n,k,d)码的平方矩阵。提出了一种新的组合解码算法来同时校正秩误差和秩擦除。如果错误和擦除的等级不大于Singleton界限,则该算法将始终给出正确的决策。如果不是这种情况,则该算法在许多情况下仍会给出正确的解决方案,但有时可能不存在唯一解决方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号