An alternative proposed single error detection algorithm for the single parity check algorithm

In this article, our objective is to propose an alternative algorithm to the single parity check algorithm that exhibits improved capabilities. To achieve this, we introduce a function for symmetrizing binary codes with an error resilience capability. Additionally, we present the symmetry check algo...

Full description

Saved in:
Bibliographic Details
Published inThe Journal of supercomputing Vol. 81; no. 7; p. 851
Main Authors Gharehbagheri, Parviz, Javadi, Hamid Haj Seyyed, Rad, Nader Jafari, Bakhshi, Hamidreza
Format Journal Article
LanguageEnglish
Published New York Springer US 10.05.2025
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN1573-0484
0920-8542
1573-0484
DOI10.1007/s11227-025-07305-8

Cover

More Information
Summary:In this article, our objective is to propose an alternative algorithm to the single parity check algorithm that exhibits improved capabilities. To achieve this, we introduce a function for symmetrizing binary codes with an error resilience capability. Additionally, we present the symmetry check algorithm for error detection and provide a theoretical proof that the error detection bits of the symmetry check algorithm not only identify errors but also enable the recovery of a portion of the original binary code bits. The symmetry check algorithm has the ability to recover a portion of the data in any channel, regardless of the level of noise present, in proportion to the introduced noise. By implementing the symmetry check algorithm on a group of 512 × 512 grayscale images with a 20 % error probability, we observed a 25 % increase in the peak signal-to-noise ratio. This feature is not present in the single parity check algorithm. One of our key achievements is that in the event of data loss in the original image, the symmetry check algorithm can detect it using the symmetry bits and recover the lost image as a black and white image, while still performing error control.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1573-0484
0920-8542
1573-0484
DOI:10.1007/s11227-025-07305-8