Abstract
This paper presents a class of integer codes capable of correcting single asymmetric errors. The presented codes are defined over the ring of integers modulo 2b– 1 and are constructed with the help of a computer. The results of an exhaustive search have shown that, for practical lengths up to 4096 bits, the proposed codes use the same number of check bits as the best systematic single asymmetric error-correcting codes (SAECCs). Besides this, it is found that for some lengths the presented codes are perfect. Finally, the paper shows that the encoding/decoding complexity of the proposed codes is notably lower than that of the best systematic SAECCs.
Similar content being viewed by others
References
Borden JM (1982) Optimal asymmetric error detecting codes. Inf Control 53(1–2):66–73
Constantin SD, Rao TRN (1979) On the theory of binary asymmetric error correcting codes. Inf Control 40(1):20–26
Hamming RW (1950) Error detecting and error correcting codes. Bell Syst Tech J 29(2):147–150
Varshamov RR, Tenengol’ts GM (1965) Correction code for single asymmetric errors. Automat Telemekh 26(2):288–292
Delsarte P, Piret P (1981) Bounds and constructions for binary asymmetric error-correcting codes. IEEE Trans Inform Theory 27(1):125–128
Shiozaki A (1982) Single asymmetric error-correcting cyclic AN codes. IEEE Trans Comput 31(6):554–555
Weber J, DeVroedt C, Boekee D (1988) Bounds and construction for binary codes of length less than 24 and asymmetric distance less than 6. IEEE Trans Inform Theory 34(5):1321–1331
Zhang Z, Xia X (1992) New lower bounds for binary codes of asymmetric distance two. IEEE Trans Inform Theory 38(5):1592–1597
Al-Bassam S, Venkatesan R, Al-Muhammadi S (1997) New single asymmetric error correcting codes. IEEE Trans Inform Theory 43(5):1619–1623
Al-Bassam S, Al-Muhammadi S (2000) A single asymmetric error-correcting code with 213 codewords of dimension 17. IEEE Trans Inform Theory 46(1):269–271
Fu F, Ling S, Xing C (2003) New lower bounds and constructions for binary codes correcting asymmetric errors. IEEE Trans Inform Theory 49(12):3294–3299
Grassl M, Shor P, Smith G, Smolin J, Zeng B (2015) New constructions of codes for asymmetric channels via concatenation. IEEE Trans Inform Theory 61(4):1879–1886
Bose B, Al-Bassam S (2000) On systematic single asymmetric error correcting codes. IEEE Trans Inform Theory 46(2):669–672
Abdel-Ghaffar K, Ferreira H (1997) Systematic encoding of the Varshamov-Tenengol’ts codes and the Constantin-Rao codes. IEEE Trans Inform Theory 43(1):340–354
Radonjic A (2018) (Perfect) Integer codes correcting single errors. IEEE Commun Lett 22(1):17–20
Radonjic A, Vujicic V (Feb. 2013) Integer codes correcting burst errors within a byte. IEEE Trans Comput 62(2):411–415
Acknowledgments
This paper was supported by the Ministry of Education, Science and Technological Development of the Republic of Serbia (Grant no. 451-03-68/2020-14/200175).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Radonjic, A. Integer codes correcting single asymmetric errors. Ann. Telecommun. 76, 109–113 (2021). https://doi.org/10.1007/s12243-020-00816-w
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12243-020-00816-w