{"title":"模块中的算术代码:多数解码方法","authors":"Oscar N. Garcia, Jorge R. Rodriguez","doi":"10.1109/ARITH.1972.6153893","DOIUrl":null,"url":null,"abstract":"It has been shown how arithmetic codes can be embedded in the structure of a module and how generator and check matrices may be defined. The motivation is to parallel the analogy with communication codes with the purpose of showing majority decoding. The technical difficulties in the derivations are pointed out while some partial results are given.","PeriodicalId":6526,"journal":{"name":"2015 IEEE 22nd Symposium on Computer Arithmetic","volume":"41 1","pages":"1-15"},"PeriodicalIF":0.0000,"publicationDate":"1972-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Arithmetic codes in a module: A majority decoding approach\",\"authors\":\"Oscar N. Garcia, Jorge R. Rodriguez\",\"doi\":\"10.1109/ARITH.1972.6153893\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It has been shown how arithmetic codes can be embedded in the structure of a module and how generator and check matrices may be defined. The motivation is to parallel the analogy with communication codes with the purpose of showing majority decoding. The technical difficulties in the derivations are pointed out while some partial results are given.\",\"PeriodicalId\":6526,\"journal\":{\"name\":\"2015 IEEE 22nd Symposium on Computer Arithmetic\",\"volume\":\"41 1\",\"pages\":\"1-15\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1972-05-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 22nd Symposium on Computer Arithmetic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARITH.1972.6153893\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 22nd Symposium on Computer Arithmetic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARITH.1972.6153893","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Arithmetic codes in a module: A majority decoding approach
It has been shown how arithmetic codes can be embedded in the structure of a module and how generator and check matrices may be defined. The motivation is to parallel the analogy with communication codes with the purpose of showing majority decoding. The technical difficulties in the derivations are pointed out while some partial results are given.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
