{"title":"An Efficient Single and Double Error Correcting Block Codes with Low Redundancy for Digital Communications","authors":"M. L. Saini, V. Sharma, Ashok Kumar","doi":"10.1109/InCACCT57535.2023.10141727","DOIUrl":null,"url":null,"abstract":"In digital communication there are various single and double bit error correcting and detecting codes are available. The efficiency of an error correcting code is evaluated by its errors correction capabilities and redundancy. This paper presents a new single bit and double bit error correcting codes which have lower redundancy compare to the other existing codes. In this paper the number of parity bits over the message bits for Hamming, BCH,RS Code, and DEC are examined and overhead is calculated. The proposed codes having less parity bits compared to other existing and having up to double bit error correction capabilities and minimize the encoding/decoding time delay.","PeriodicalId":405272,"journal":{"name":"2023 International Conference on Advancement in Computation & Computer Technologies (InCACCT)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference on Advancement in Computation & Computer Technologies (InCACCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/InCACCT57535.2023.10141727","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In digital communication there are various single and double bit error correcting and detecting codes are available. The efficiency of an error correcting code is evaluated by its errors correction capabilities and redundancy. This paper presents a new single bit and double bit error correcting codes which have lower redundancy compare to the other existing codes. In this paper the number of parity bits over the message bits for Hamming, BCH,RS Code, and DEC are examined and overhead is calculated. The proposed codes having less parity bits compared to other existing and having up to double bit error correction capabilities and minimize the encoding/decoding time delay.