{"title":"关于玻色-拉奥-蒙哥马利单向错误码每多一个比特误差所引起的纠错","authors":"M. Goto, T. Matsumoto","doi":"10.1109/ICCS.1992.254885","DOIUrl":null,"url":null,"abstract":"By modifying the symmetric error correcting codes, Bose and Rao (1984) have obtained the unidirectional error-correcting (UEC) codes for shift register memories by using arithmetic redundancy check (ARC) in stead of cyclic redundancy check. Montgomery (see IEEE Trans. Comput., vol.40, p.1257, 1991) has proposed UEC code that correct any error pattern consisting of unidirectional errors confined to a single track. The UEC codes presented by Bose and Rao are a particular case of the codes by Montgomery. Although the latter is more efficient than the former, these two classes of code are constructed based on the same idea, and so the authors call these codes Bose Rao-Montgomery (BRM) codes. They consider the conditions under which such mis-corrections occur, and show that the row parity for each track is the suitable way of preventing from mis-corrections due to the single bit error in the other track.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the mis-correction due to any one extra bit error of Bose-Rao-Montgomery unidirectional error codes\",\"authors\":\"M. Goto, T. Matsumoto\",\"doi\":\"10.1109/ICCS.1992.254885\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"By modifying the symmetric error correcting codes, Bose and Rao (1984) have obtained the unidirectional error-correcting (UEC) codes for shift register memories by using arithmetic redundancy check (ARC) in stead of cyclic redundancy check. Montgomery (see IEEE Trans. Comput., vol.40, p.1257, 1991) has proposed UEC code that correct any error pattern consisting of unidirectional errors confined to a single track. The UEC codes presented by Bose and Rao are a particular case of the codes by Montgomery. Although the latter is more efficient than the former, these two classes of code are constructed based on the same idea, and so the authors call these codes Bose Rao-Montgomery (BRM) codes. They consider the conditions under which such mis-corrections occur, and show that the row parity for each track is the suitable way of preventing from mis-corrections due to the single bit error in the other track.<<ETX>>\",\"PeriodicalId\":223769,\"journal\":{\"name\":\"[Proceedings] Singapore ICCS/ISITA `92\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings] Singapore ICCS/ISITA `92\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCS.1992.254885\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings] Singapore ICCS/ISITA `92","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCS.1992.254885","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the mis-correction due to any one extra bit error of Bose-Rao-Montgomery unidirectional error codes
By modifying the symmetric error correcting codes, Bose and Rao (1984) have obtained the unidirectional error-correcting (UEC) codes for shift register memories by using arithmetic redundancy check (ARC) in stead of cyclic redundancy check. Montgomery (see IEEE Trans. Comput., vol.40, p.1257, 1991) has proposed UEC code that correct any error pattern consisting of unidirectional errors confined to a single track. The UEC codes presented by Bose and Rao are a particular case of the codes by Montgomery. Although the latter is more efficient than the former, these two classes of code are constructed based on the same idea, and so the authors call these codes Bose Rao-Montgomery (BRM) codes. They consider the conditions under which such mis-corrections occur, and show that the row parity for each track is the suitable way of preventing from mis-corrections due to the single bit error in the other track.<>