{"title":"多元插值列表解码的最优权值分配","authors":"R. Koetter","doi":"10.1109/ITW.2006.1633777","DOIUrl":null,"url":null,"abstract":"We consider the weight assignment problem for multivariate interpolation-based decoding. The resulting optimization problem is solved under the assumption that the codes are not too short (the integrality gap for our relaxations approaches zero as the code length grows) and the optimal weight assignment scheme is given for the criterion of maximizing an allowable additive cost (e.g. Hamming distance or log-probability, etc.) of an error event.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"On optimal weight assignmnents for multivariate interpolation list-decoding\",\"authors\":\"R. Koetter\",\"doi\":\"10.1109/ITW.2006.1633777\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the weight assignment problem for multivariate interpolation-based decoding. The resulting optimization problem is solved under the assumption that the codes are not too short (the integrality gap for our relaxations approaches zero as the code length grows) and the optimal weight assignment scheme is given for the criterion of maximizing an allowable additive cost (e.g. Hamming distance or log-probability, etc.) of an error event.\",\"PeriodicalId\":293144,\"journal\":{\"name\":\"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-03-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2006.1633777\",\"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 Information Theory Workshop - ITW '06 Punta del Este","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2006.1633777","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On optimal weight assignmnents for multivariate interpolation list-decoding
We consider the weight assignment problem for multivariate interpolation-based decoding. The resulting optimization problem is solved under the assumption that the codes are not too short (the integrality gap for our relaxations approaches zero as the code length grows) and the optimal weight assignment scheme is given for the criterion of maximizing an allowable additive cost (e.g. Hamming distance or log-probability, etc.) of an error event.