• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >Limited-Magnitude Error-Correcting Gray Codes for Rank Modulation
【24h】

Limited-Magnitude Error-Correcting Gray Codes for Rank Modulation

机译：用于秩调制的限幅纠错格雷码

获取原文
获取原文并翻译 | 示例
       
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We construct error-correcting codes over permutations under the infinity-metric, which are also Gray codes in the context of rank modulation, i.e., are generated as simple circuits in the rotator graph. These errors model limited-magnitude or spike errors, for which only single-error-detecting Gray codes are currently known. Surprisingly, the error-correcting codes we construct achieve a better asymptotic rate than that of presently known constructions not having the Gray property, and exceed the Gilbert-Varshamov bound. Additionally, we present efficient ranking and unranking procedures, as well as a decoding procedure that runs in linear time. Finally, we also apply our methods to solve an outstanding issue with error-detecting rank-modulation Gray codes (also known in this context as snake-in-the-box codes) under a different metric, the Kendall -metric, in the group of permutations over an even number of elements , where we provide asymptotically optimal codes.
机译：我们在无穷大度量下的置换上构造纠错码，在秩调制的上下文中它们也是格雷码，即，在旋转图中作为简单电路生成。这些错误模拟了有限幅度或尖峰错误，目前仅知道这些错误的格雷码。令人惊讶地，我们构造的纠错码比目前不具有Gray属性的构造具有更好的渐近率，并且超出了Gilbert-Varshamov界限。此外，我们提出了有效的排名和取消排名程序，以及在线性时间内运行的解码程序。最后，我们还运用我们的方法来解决一个错误问题，即在组中使用不同度量（Kendall度量）下的检错秩调制格雷码（在这种情况下也称为盒中蛇码）在偶数个元素上的排列，我们提供渐近最优代码。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号