一些六边形(d,k)约束的容量

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI:10.1109/ISIT.2001.935927

Z. Kukorelly, K. Zeger

{"title":"一些六边形(d,k)约束的容量","authors":"Z. Kukorelly, K. Zeger","doi":"10.1109/ISIT.2001.935927","DOIUrl":null,"url":null,"abstract":"We consider two-dimensional binary codes whose bits lie on a hexagonal lattice and satisfy a (d,k) constraint in six directions. We prove that the capacity is zero if k=d+2 and give positive lower bounds on the capacity for k/spl ges/4[d/2]+1.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"847 ","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"The capacity of some hexagonal (d,k)-constraints\",\"authors\":\"Z. Kukorelly, K. Zeger\",\"doi\":\"10.1109/ISIT.2001.935927\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider two-dimensional binary codes whose bits lie on a hexagonal lattice and satisfy a (d,k) constraint in six directions. We prove that the capacity is zero if k=d+2 and give positive lower bounds on the capacity for k/spl ges/4[d/2]+1.\",\"PeriodicalId\":433761,\"journal\":{\"name\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"volume\":\"847 \",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2001.935927\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2001.935927","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

我们考虑二维二进制码，其位位于六边形晶格上，并且在六个方向上满足(d,k)约束。证明了k=d+2时容量为零，并给出了k/spl ges/4[d/2]+1时容量的正下界。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

The capacity of some hexagonal (d,k)-constraints

We consider two-dimensional binary codes whose bits lie on a hexagonal lattice and satisfy a (d,k) constraint in six directions. We prove that the capacity is zero if k=d+2 and give positive lower bounds on the capacity for k/spl ges/4[d/2]+1.

求助全文

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

来源期刊

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)

自引率

0.00%

发文量

期刊最新文献

A simple encodable/decodable OFDM QPSK code with low peak-to-mean envelope power ratio The effect of redundancy on measurement Decision directed algorithms for multiuser detection A new modulation scheme using asymmetric error correcting code embedded in optical orthogonal code for optical CDMA Matrix CUSUM: a recursive multi-hypothesis change detection algorithm