{"title":"双重纠错的多残码","authors":"P. Monteiro, T. Rao","doi":"10.1109/ARITH.1972.6153889","DOIUrl":null,"url":null,"abstract":"A new class of (separate) multiresidue codes has been proposed, which is capable of double error correction. The codes are derived from a class of AN codes where A is of the form π i=1 3(2ki−1). Previously all discussions on separate code implementation had restricted themselves to single error correcting codes only. We have shown that these multiple-error correcting separate codes can be relatively easily implemented as the check bases are of the form 2k−1. A comparison with the multiresidue codes derived from Barrows-Mandelbaum codes has shown that these codes have in general a higher information rate and an easier implementation.","PeriodicalId":6526,"journal":{"name":"2015 IEEE 22nd Symposium on Computer Arithmetic","volume":"162 1","pages":"1-13"},"PeriodicalIF":0.0000,"publicationDate":"1972-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Multiresidue codes for double error correction\",\"authors\":\"P. Monteiro, T. Rao\",\"doi\":\"10.1109/ARITH.1972.6153889\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new class of (separate) multiresidue codes has been proposed, which is capable of double error correction. The codes are derived from a class of AN codes where A is of the form π i=1 3(2ki−1). Previously all discussions on separate code implementation had restricted themselves to single error correcting codes only. We have shown that these multiple-error correcting separate codes can be relatively easily implemented as the check bases are of the form 2k−1. A comparison with the multiresidue codes derived from Barrows-Mandelbaum codes has shown that these codes have in general a higher information rate and an easier implementation.\",\"PeriodicalId\":6526,\"journal\":{\"name\":\"2015 IEEE 22nd Symposium on Computer Arithmetic\",\"volume\":\"162 1\",\"pages\":\"1-13\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1972-05-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 22nd Symposium on Computer Arithmetic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARITH.1972.6153889\",\"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.6153889","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new class of (separate) multiresidue codes has been proposed, which is capable of double error correction. The codes are derived from a class of AN codes where A is of the form π i=1 3(2ki−1). Previously all discussions on separate code implementation had restricted themselves to single error correcting codes only. We have shown that these multiple-error correcting separate codes can be relatively easily implemented as the check bases are of the form 2k−1. A comparison with the multiresidue codes derived from Barrows-Mandelbaum codes has shown that these codes have in general a higher information rate and an easier implementation.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
