Capacity of M-ary multitrack RLL codes for storage channels

Jaejin Lee
{"title":"Capacity of M-ary multitrack RLL codes for storage channels","authors":"Jaejin Lee","doi":"10.1109/ICC.1998.685155","DOIUrl":null,"url":null,"abstract":"This paper introduces M-ary multitrack runlength limited (RLL) (d,k) constrained codes for data storage systems. We calculate the capacities and densities of the codes. We have derived a general form of the state transition matrix for M-ary n-track (d,k) codes. Using the largest eigenvalue of the transition matrix, we calculate the capacity and density. The capacity approaches to the limit with a small k constraint compared to single-track codes. One can design some practical M-ary multitrack codes applying the same algorithms for single-track codes.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.1998.685155","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper introduces M-ary multitrack runlength limited (RLL) (d,k) constrained codes for data storage systems. We calculate the capacities and densities of the codes. We have derived a general form of the state transition matrix for M-ary n-track (d,k) codes. Using the largest eigenvalue of the transition matrix, we calculate the capacity and density. The capacity approaches to the limit with a small k constraint compared to single-track codes. One can design some practical M-ary multitrack codes applying the same algorithms for single-track codes.
用于存储信道的多道RLL码容量
本文介绍了用于数据存储系统的多道限行码(RLL)约束码。我们计算了码的容量和密度。我们导出了m - n-轨(d,k)码的状态转移矩阵的一般形式。利用迁移矩阵的最大特征值,计算了迁移矩阵的容量和密度。与单轨码相比,容量接近极限,具有较小的k约束。我们可以设计一些实用的多轨码,应用与单轨码相同的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信