{"title":"用结构化代码校正通信系统中的独立错误和字节类型错误","authors":"S.S. Sorokin, U.V. Bolotnaya, S.A. Bolotniy, S.V. Buslov, A.S. Kuleshov","doi":"10.1109/CRMICO.2002.1137224","DOIUrl":null,"url":null,"abstract":"Current publications devoted to noise-proof coding, declare that byte-type error detection and correction are particularly effective. However, independent errors up to t-multiplicity may appear in transmitted code-words. Taking account the above, it is necessary to develop codes, to enable the correction of the above error types with fine veracity of the information transmitted, possessing simple decoding algorithms, and not requiring delay of data exchange. This paper suggests codes, which are able to decode data blocks with q/sub 5/<10/sup -6/ error probability per one symbol at q/sub 0/=0.05 error probability per one symbol in the received word. These codes are able to correct byte errors of several bytes length. It is evident that such codes possess relatively lower transmission rate than BChH codes.","PeriodicalId":378024,"journal":{"name":"12th International Conference Microwave and Telecommunication Technology","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Correction of independent errors and byte-type errors in communication systems using structured codes\",\"authors\":\"S.S. Sorokin, U.V. Bolotnaya, S.A. Bolotniy, S.V. Buslov, A.S. Kuleshov\",\"doi\":\"10.1109/CRMICO.2002.1137224\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Current publications devoted to noise-proof coding, declare that byte-type error detection and correction are particularly effective. However, independent errors up to t-multiplicity may appear in transmitted code-words. Taking account the above, it is necessary to develop codes, to enable the correction of the above error types with fine veracity of the information transmitted, possessing simple decoding algorithms, and not requiring delay of data exchange. This paper suggests codes, which are able to decode data blocks with q/sub 5/<10/sup -6/ error probability per one symbol at q/sub 0/=0.05 error probability per one symbol in the received word. These codes are able to correct byte errors of several bytes length. It is evident that such codes possess relatively lower transmission rate than BChH codes.\",\"PeriodicalId\":378024,\"journal\":{\"name\":\"12th International Conference Microwave and Telecommunication Technology\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-09-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"12th International Conference Microwave and Telecommunication Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CRMICO.2002.1137224\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"12th International Conference Microwave and Telecommunication Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CRMICO.2002.1137224","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Correction of independent errors and byte-type errors in communication systems using structured codes
Current publications devoted to noise-proof coding, declare that byte-type error detection and correction are particularly effective. However, independent errors up to t-multiplicity may appear in transmitted code-words. Taking account the above, it is necessary to develop codes, to enable the correction of the above error types with fine veracity of the information transmitted, possessing simple decoding algorithms, and not requiring delay of data exchange. This paper suggests codes, which are able to decode data blocks with q/sub 5/<10/sup -6/ error probability per one symbol at q/sub 0/=0.05 error probability per one symbol in the received word. These codes are able to correct byte errors of several bytes length. It is evident that such codes possess relatively lower transmission rate than BChH codes.