{"title":"用于存储信道的多道RLL码容量","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":"{\"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}","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}
Capacity of M-ary multitrack RLL codes for storage channels
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.