{"title":"在擦除网络中对多个数据包进行编码","authors":"Hamid Dadkhahi, T. Chan, I. Land","doi":"10.1109/AusCTW.2012.6164916","DOIUrl":null,"url":null,"abstract":"Coding over noisy channels commonly aims at errorfree recovery of all messages. In the present paper we address a different concept: multiple finite-length packets are to be transmitted over a noisy block-fading channel, and the goal is to maximize the number of correctly decoded packets. Specifically, we consider the case of transmission of two messages over a block-fading erasure channel to gain fundamental insights. We consider three different coding strategies and derive analytically the probabilities of error for constructions based on random codes and maximum distance separable (MDS) codes.","PeriodicalId":320391,"journal":{"name":"2012 Australian Communications Theory Workshop (AusCTW)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Coding for multiple packets in erasure networks\",\"authors\":\"Hamid Dadkhahi, T. Chan, I. Land\",\"doi\":\"10.1109/AusCTW.2012.6164916\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Coding over noisy channels commonly aims at errorfree recovery of all messages. In the present paper we address a different concept: multiple finite-length packets are to be transmitted over a noisy block-fading channel, and the goal is to maximize the number of correctly decoded packets. Specifically, we consider the case of transmission of two messages over a block-fading erasure channel to gain fundamental insights. We consider three different coding strategies and derive analytically the probabilities of error for constructions based on random codes and maximum distance separable (MDS) codes.\",\"PeriodicalId\":320391,\"journal\":{\"name\":\"2012 Australian Communications Theory Workshop (AusCTW)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-03-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Australian Communications Theory Workshop (AusCTW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AusCTW.2012.6164916\",\"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 Australian Communications Theory Workshop (AusCTW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AusCTW.2012.6164916","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Coding over noisy channels commonly aims at errorfree recovery of all messages. In the present paper we address a different concept: multiple finite-length packets are to be transmitted over a noisy block-fading channel, and the goal is to maximize the number of correctly decoded packets. Specifically, we consider the case of transmission of two messages over a block-fading erasure channel to gain fundamental insights. We consider three different coding strategies and derive analytically the probabilities of error for constructions based on random codes and maximum distance separable (MDS) codes.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
