{"title":"丢包恢复稀疏图码的几个问题","authors":"G. Liva, M. Chiani, M. Berioli, S. Scalise","doi":"10.1109/IWSSC.2007.4409408","DOIUrl":null,"url":null,"abstract":"In this paper we provide some novel design techniques for sparse-graph-based erasure correcting codes. The paper is focused on codes based on sparse graph belonging to the category of the so-called generalized low-density parity-check (G-LDPC) codes. Some design insights are provided for multi-edge type G-LDPC codes based on protographs. The performance assessment of some G-LDPC codes is carried out by use of both simulation and analytic tools, showing the capacity-approaching performance of the presented code designs on the uncorrelated binary erasure channel.","PeriodicalId":286578,"journal":{"name":"2007 International Workshop on Satellite and Space Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Some Remarks on Sparse Graph Codes for Packet Loss Recovery\",\"authors\":\"G. Liva, M. Chiani, M. Berioli, S. Scalise\",\"doi\":\"10.1109/IWSSC.2007.4409408\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we provide some novel design techniques for sparse-graph-based erasure correcting codes. The paper is focused on codes based on sparse graph belonging to the category of the so-called generalized low-density parity-check (G-LDPC) codes. Some design insights are provided for multi-edge type G-LDPC codes based on protographs. The performance assessment of some G-LDPC codes is carried out by use of both simulation and analytic tools, showing the capacity-approaching performance of the presented code designs on the uncorrelated binary erasure channel.\",\"PeriodicalId\":286578,\"journal\":{\"name\":\"2007 International Workshop on Satellite and Space Communications\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Workshop on Satellite and Space Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWSSC.2007.4409408\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Workshop on Satellite and Space Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWSSC.2007.4409408","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Some Remarks on Sparse Graph Codes for Packet Loss Recovery
In this paper we provide some novel design techniques for sparse-graph-based erasure correcting codes. The paper is focused on codes based on sparse graph belonging to the category of the so-called generalized low-density parity-check (G-LDPC) codes. Some design insights are provided for multi-edge type G-LDPC codes based on protographs. The performance assessment of some G-LDPC codes is carried out by use of both simulation and analytic tools, showing the capacity-approaching performance of the presented code designs on the uncorrelated binary erasure channel.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
