Channel coding with strictly casual colored side-information at transmitter

V. Prabhakaran, David Tse, K. Ramchandran
{"title":"Channel coding with strictly casual colored side-information at transmitter","authors":"V. Prabhakaran, David Tse, K. Ramchandran","doi":"10.1109/ISIT.2007.4557254","DOIUrl":null,"url":null,"abstract":"In this paper we study channels where a side-information sequence is available strictly causally at the transmitter, i.e., the channel input at time k may depend on the side-information sequence up to and including time k - 1. This is in contrast to Shannon's channel coding with causal side-information at the transmitter where the channel input at time k may depend on the side-information sequence up to and including time k. We consider side-information sequences with memory and study the Gaussian and modulo-additive channels.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2007.4557254","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper we study channels where a side-information sequence is available strictly causally at the transmitter, i.e., the channel input at time k may depend on the side-information sequence up to and including time k - 1. This is in contrast to Shannon's channel coding with causal side-information at the transmitter where the channel input at time k may depend on the side-information sequence up to and including time k. We consider side-information sequences with memory and study the Gaussian and modulo-additive channels.
在发射机上带有严格随意的彩色边信息的信道编码
本文研究了在发送端侧信息序列是严格因果可用的信道,即在k时刻的信道输入可能依赖于且包括k - 1时刻的侧信息序列。这与香农在发射机处具有因果侧信息的信道编码相反,其中时刻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学术官方微信