Integer codes correcting single asymmetric errors
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.
Keywords:
integer codes / single asymmetric errors / error correction / perfect codesSource:
Annals of Telecommunications, 2021, 76, 1-2, 109-113Publisher:
- Springer Science and Business Media LLC
Funding / projects:
Note:
- Peer-reviewed manuscript: https://hdl.handle.net/21.15107/rcub_dais_11654
Related info:
DOI: 10.1007/s12243-020-00816-w
ISSN: 0003-4347; 1958-9395
WoS: 000607469100001
Scopus: 2-s2.0-85099181468
Institution/Community
Институт техничких наука САНУ / Institute of Technical Sciences of SASATY - JOUR AU - Radonjic, Aleksandar PY - 2021 UR - https://dais.sanu.ac.rs/123456789/11652 AB - 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. PB - Springer Science and Business Media LLC T2 - Annals of Telecommunications T1 - Integer codes correcting single asymmetric errors SP - 109 EP - 113 VL - 76 IS - 1-2 DO - 10.1007/s12243-020-00816-w UR - https://hdl.handle.net/21.15107/rcub_dais_11652 ER -
@article{ author = "Radonjic, Aleksandar", year = "2021", 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.", publisher = "Springer Science and Business Media LLC", journal = "Annals of Telecommunications", title = "Integer codes correcting single asymmetric errors", pages = "109-113", volume = "76", number = "1-2", doi = "10.1007/s12243-020-00816-w", url = "https://hdl.handle.net/21.15107/rcub_dais_11652" }
Radonjic, A.. (2021). Integer codes correcting single asymmetric errors. in Annals of Telecommunications Springer Science and Business Media LLC., 76(1-2), 109-113. https://doi.org/10.1007/s12243-020-00816-w https://hdl.handle.net/21.15107/rcub_dais_11652
Radonjic A. Integer codes correcting single asymmetric errors. in Annals of Telecommunications. 2021;76(1-2):109-113. doi:10.1007/s12243-020-00816-w https://hdl.handle.net/21.15107/rcub_dais_11652 .
Radonjic, Aleksandar, "Integer codes correcting single asymmetric errors" in Annals of Telecommunications, 76, no. 1-2 (2021):109-113, https://doi.org/10.1007/s12243-020-00816-w ., https://hdl.handle.net/21.15107/rcub_dais_11652 .