{"title":"高斯信道可靠性函数的新结果","authors":"M. Burnashev","doi":"10.1109/ISIT.2007.4557270","DOIUrl":null,"url":null,"abstract":"A new approach for upper bounding the channel reliability function using the code spectrum is described. It allows both low and high rate cases to be treated in a unified way. In particular, the earlier known upper bounds are improved, and a new derivation of the sphere-packing bound is presented.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New Results on the Reliability Function of the Gaussian Channel\",\"authors\":\"M. Burnashev\",\"doi\":\"10.1109/ISIT.2007.4557270\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new approach for upper bounding the channel reliability function using the code spectrum is described. It allows both low and high rate cases to be treated in a unified way. In particular, the earlier known upper bounds are improved, and a new derivation of the sphere-packing bound is presented.\",\"PeriodicalId\":193467,\"journal\":{\"name\":\"2007 IEEE International Symposium on Information Theory\",\"volume\":\"106 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.4557270\",\"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 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2007.4557270","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
New Results on the Reliability Function of the Gaussian Channel
A new approach for upper bounding the channel reliability function using the code spectrum is described. It allows both low and high rate cases to be treated in a unified way. In particular, the earlier known upper bounds are improved, and a new derivation of the sphere-packing bound is presented.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
