有限域上线性算子信道的叠加编码

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI:10.1109/ITW.2012.6404724

Shenghao Yang

{"title":"有限域上线性算子信道的叠加编码","authors":"Shenghao Yang","doi":"10.1109/ITW.2012.6404724","DOIUrl":null,"url":null,"abstract":"A coding approach based on the superposition structure is proposed for linear operator channels. Under a subspace decoding rule, a lower bound on the maximum achievable rate of this coding approach is characterized. Under the subspace decoding rule, this coding approach is capacity achieving for a class of linear operator channels, and it can potentially achieve higher rates than the subspace coding approach.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Superposition coding for linear operator channels over finite fields\",\"authors\":\"Shenghao Yang\",\"doi\":\"10.1109/ITW.2012.6404724\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A coding approach based on the superposition structure is proposed for linear operator channels. Under a subspace decoding rule, a lower bound on the maximum achievable rate of this coding approach is characterized. Under the subspace decoding rule, this coding approach is capacity achieving for a class of linear operator channels, and it can potentially achieve higher rates than the subspace coding approach.\",\"PeriodicalId\":325771,\"journal\":{\"name\":\"2012 IEEE Information Theory Workshop\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Information Theory Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2012.6404724\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Information Theory Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2012.6404724","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

提出了一种基于叠加结构的线性算子信道编码方法。在子空间译码规则下，给出了该编码方法最大可达率的下界特征。在子空间译码规则下，这种编码方法是对一类线性算子信道的容量实现，并且有可能比子空间编码方法实现更高的译码率。

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

查看原文本刊更多论文

Superposition coding for linear operator channels over finite fields

A coding approach based on the superposition structure is proposed for linear operator channels. Under a subspace decoding rule, a lower bound on the maximum achievable rate of this coding approach is characterized. Under the subspace decoding rule, this coding approach is capacity achieving for a class of linear operator channels, and it can potentially achieve higher rates than the subspace coding approach.

求助全文

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

来源期刊

2012 IEEE Information Theory Workshop

自引率

0.00%

发文量