...
首页> 外文期刊>Information Theory, IEEE Transactions on >Error-Correction in Flash Memories via Codes in the Ulam Metric
【24h】

Error-Correction in Flash Memories via Codes in the Ulam Metric

机译:通过Ulam度量标准中的代码在Flash存储器中进行错误校正

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

摘要

We consider rank modulation codes for flash memories that allow for handling arbitrary charge-drop errors. Unlike classical rank modulation codes used for correcting errors that manifest themselves as swaps of two adjacently ranked elements, the proposed translocation rank codes account for more general forms of errors that arise in storage systems. Translocations represent a natural extension of the notion of adjacent transpositions and as such may be analyzed using related concepts in combinatorics and rank modulation coding. Our results include derivation of the asymptotic capacity of translocation rank codes, construction techniques for asymptotically good codes, as well as simple decoding methods for one class of constructed codes. As part of our exposition, we also highlight the close connections between the new code family and permutations with short common subsequences, deletion and insertion error-correcting codes for permutations, and permutation codes in the Hamming distance.
机译:<?Pub Dtl?>我们考虑了闪存的秩调制码,该码可以处理任意电荷下降错误。与用于校正表现为两个相邻排序元素的交换的错误的经典秩调制码不同,建议的易位秩码解决了存储系统中出现的更一般形式的错误。易位表示相邻换位概念的自然扩展,因此可以使用组合技术和秩调制编码中的相关概念进行分析。我们的结果包括易位列码的渐近能力的推导,渐近良好码的构造技术以及一类构造码的简单解码方法。作为我们论述的一部分,我们还将重点介绍新代码家族与具有较短公共子序列的置换,置换的删除和插入纠错码以及汉明距离中的置换码之间的紧密联系。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号