二维M-ary (0, k)和(d，∞)运行长度受限通道的容量下界

2006 IEEE International Symposium on Information Theory Pub Date : 2006-07-09 DOI:10.1109/ISIT.2006.262112

S. G. Srinivasa, S. McLaughlin

{"title":"二维M-ary (0, k)和(d，∞)运行长度受限通道的容量下界","authors":"S. G. Srinivasa, S. McLaughlin","doi":"10.1109/ISIT.2006.262112","DOIUrl":null,"url":null,"abstract":"We present lower bounds on the two-dimensional capacity for two sets of symmetric and asymmetric M-ary runlength-limited constraints. The bounds extend and generalize our previous work on binary constraints. We also give sequential coding algorithms achieving the derived capacity lower bounds","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"126 17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Capacity Lower Bounds for Two-Dimensional M-ary (0, k) and (d, ∞) Runlength-limited Channels\",\"authors\":\"S. G. Srinivasa, S. McLaughlin\",\"doi\":\"10.1109/ISIT.2006.262112\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present lower bounds on the two-dimensional capacity for two sets of symmetric and asymmetric M-ary runlength-limited constraints. The bounds extend and generalize our previous work on binary constraints. We also give sequential coding algorithms achieving the derived capacity lower bounds\",\"PeriodicalId\":115298,\"journal\":{\"name\":\"2006 IEEE International Symposium on Information Theory\",\"volume\":\"126 17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2006.262112\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2006.262112","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

我们给出了两组对称和非对称M-ary长度限制约束的二维容量下界。这些边界扩展和推广了我们之前关于二元约束的工作。我们还给出了实现导出的容量下界的顺序编码算法

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Capacity Lower Bounds for Two-Dimensional M-ary (0, k) and (d, ∞) Runlength-limited Channels

We present lower bounds on the two-dimensional capacity for two sets of symmetric and asymmetric M-ary runlength-limited constraints. The bounds extend and generalize our previous work on binary constraints. We also give sequential coding algorithms achieving the derived capacity lower bounds

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2006 IEEE International Symposium on Information Theory

自引率

0.00%

发文量