Integer Codes Correcting Single Errors and Detecting Double Adjacent Errors

This paper presents two classes of integer codes called integer SEC-(DAED) b codes and integer SEC-DAED codes. The first class of codes can correct all single errors and detect all double adjacent (DA) errors within a b-bit byte, while the second class of codes has the ability to correct all single errors and detect all DA errors. Both classes of codes are defined over integer rings and are generated by computer search. To evaluate the performance of the proposed codes, we analyze the probability of incorrect decoding for different error rates. In addition, the paper shows that the proposed codes have a slightly higher redundancy than linear SEC-DAED codes, but also a much simpler decoding algorithm.

Authors

Institutions

Publication Details

Journal
International Journal of Foundations of Computer Science
Published
2024-12-06
DOI
https://doi.org/10.1142/s0129054124500229
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Integer Codes Correcting Single Errors and Detecting Double Adjacent Errors

Aleksandar Radonjić, Ivan Sćepanović, Igor Ristić
International Journal of Foundations of Computer Science
Coding theory and cryptography
article

Integer Codes Correcting Single Errors and Detecting Double Adjacent Errors

Aleksandar Radonjić, Ivan Sćepanović, Igor Ristić
article en

Abstract

This paper presents two classes of integer codes called integer SEC-(DAED) b codes and integer SEC-DAED codes. The first class of codes can correct all single errors and detect all double adjacent (DA) errors within a b-bit byte, while the second class of codes has the ability to correct all single errors and detect all DA errors. Both classes of codes are defined over integer rings and are generated by computer search. To evaluate the performance of the proposed codes, we analyze the probability of incorrect decoding for different error rates. In addition, the paper shows that the proposed codes have a slightly higher redundancy than linear SEC-DAED codes, but also a much simpler decoding algorithm.

International Journal of Foundations of Computer ScienceVol. 36(06)
Serbian Academy of Sciences and Arts (RS), Institute of Technical Sciences of SASA (RS), Univerzitet Union Nikola Tesla (RS)
Openalex Percentile: Top 80%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.