{"title":"标度参数的解析确定","authors":"A. Amraoui, A. Montanari, R. Urbanke","doi":"10.1109/ISIT.2006.261779","DOIUrl":null,"url":null,"abstract":"We show that the finite-length scaling parameters for irregular LDPC codes when used over the binary erasure channel can be computed without resorting to \"covariance evolution\". We provide simple expressions that can be evaluated using solely the degree distributions and the characteristics of the fixed point of density evolution","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"254 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Analytic Determination of Scaling Parameters\",\"authors\":\"A. Amraoui, A. Montanari, R. Urbanke\",\"doi\":\"10.1109/ISIT.2006.261779\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that the finite-length scaling parameters for irregular LDPC codes when used over the binary erasure channel can be computed without resorting to \\\"covariance evolution\\\". We provide simple expressions that can be evaluated using solely the degree distributions and the characteristics of the fixed point of density evolution\",\"PeriodicalId\":115298,\"journal\":{\"name\":\"2006 IEEE International Symposium on Information Theory\",\"volume\":\"254 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2006.261779\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2006.261779","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We show that the finite-length scaling parameters for irregular LDPC codes when used over the binary erasure channel can be computed without resorting to "covariance evolution". We provide simple expressions that can be evaluated using solely the degree distributions and the characteristics of the fixed point of density evolution
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
