双链路突发擦除信道的流码

D. Lui, Ahmed Badr, A. Khisti
{"title":"双链路突发擦除信道的流码","authors":"D. Lui, Ahmed Badr, A. Khisti","doi":"10.1109/CWIT.2011.5872144","DOIUrl":null,"url":null,"abstract":"A sender and receiver are connected by two links, which both pass through a burst erasure channel. The channel induces an erasure burst of length B onto both links, but the bursts are separated by d time units. Source packets arrive at the sender, and are encoded with a streaming code such that the receiver can decode with a delay T. If source packet s[t] arrives at the sender at time t, then the receiver must be able to decode s[t] by time t+T from its received packets. Given the parameters B, T and d, we find the upper bound for the rate of the streaming code, and also discover codes that can operate at capacity for certain parameter values. The code constructions also internally make use of SCo codes. Finally, we find that by exploiting the dependence of the burst erasure locations on either link, we can achieve a higher rate than if we simply used single-link SCo codes on each link.","PeriodicalId":250626,"journal":{"name":"2011 12th Canadian Workshop on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Streaming codes for a double-link burst erasure channel\",\"authors\":\"D. Lui, Ahmed Badr, A. Khisti\",\"doi\":\"10.1109/CWIT.2011.5872144\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A sender and receiver are connected by two links, which both pass through a burst erasure channel. The channel induces an erasure burst of length B onto both links, but the bursts are separated by d time units. Source packets arrive at the sender, and are encoded with a streaming code such that the receiver can decode with a delay T. If source packet s[t] arrives at the sender at time t, then the receiver must be able to decode s[t] by time t+T from its received packets. Given the parameters B, T and d, we find the upper bound for the rate of the streaming code, and also discover codes that can operate at capacity for certain parameter values. The code constructions also internally make use of SCo codes. Finally, we find that by exploiting the dependence of the burst erasure locations on either link, we can achieve a higher rate than if we simply used single-link SCo codes on each link.\",\"PeriodicalId\":250626,\"journal\":{\"name\":\"2011 12th Canadian Workshop on Information Theory\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 12th Canadian Workshop on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CWIT.2011.5872144\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 12th Canadian Workshop on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CWIT.2011.5872144","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

发送方和接收方由两条链路连接,这两条链路都通过一个突发擦除通道。该信道在两个链路上都产生了长度为B的擦除突发,但这些突发之间间隔了d个时间单位。源数据包到达发送方,用流码编码,使得接收方可以用延迟t进行解码。如果源数据包s[t]在时间t到达发送方,那么接收方必须能够在时间t+ t之前从接收到的数据包中解码s[t]。给定参数B, T和d,我们找到了流码速率的上界,也发现了在某些参数值下可以满负荷运行的码。代码结构也在内部使用SCo代码。最后,我们发现通过利用任意链路上的突发擦除位置的依赖性,我们可以获得比在每个链路上简单地使用单链路SCo码更高的速率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Streaming codes for a double-link burst erasure channel
A sender and receiver are connected by two links, which both pass through a burst erasure channel. The channel induces an erasure burst of length B onto both links, but the bursts are separated by d time units. Source packets arrive at the sender, and are encoded with a streaming code such that the receiver can decode with a delay T. If source packet s[t] arrives at the sender at time t, then the receiver must be able to decode s[t] by time t+T from its received packets. Given the parameters B, T and d, we find the upper bound for the rate of the streaming code, and also discover codes that can operate at capacity for certain parameter values. The code constructions also internally make use of SCo codes. Finally, we find that by exploiting the dependence of the burst erasure locations on either link, we can achieve a higher rate than if we simply used single-link SCo codes on each link.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信