Affiliations: [a] Department of Mathematics, Science and Research Branch, Islamic Azad University (IAU), Tehran, Iran. [email protected] | [b] Department of Pure Mathematics, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran. [email protected] | [c] Department of Mathematics, Science and Research Branch, Islamic Azad University (IAU), Tehran, Iran. [email protected]
Correspondence:
[*]
Address for correspondence: Department of Pure Mathematics, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran.
Abstract: Hamming codes are of primary concern in information theory and its applications. Despite a number of researches that have been conducted on such codes and their characterizations, dealing with the properties of previously introduced codes in a BCK-algebraic framework has not been considered in earlier works. This paper investigates a code constructed based on BCK-algebraic models and proposes an algorithm corresponding to the presented code. It is noticeable that the suggested rendered algorithm is also established on the basis of the elements of a BCK-algebra. In fact, both the Hamming distance and dimension, associated with the presented code, can be estimated through a BCK-algebra structure due to the mechanism of its algorithm which is heavily dependent on the parity check matrix. In addition, the way in which the codes are designed contributes substantially to classification of them and to extract greater number of their attributes compared to the previous works. The highlight of the proposed method is that the number of atoms of the BCK-algebra plays a key role in calculation of the Hamming distance and dimension of these codes. Moreover, the obtained codes possess specified and recognizable Hamming distance which are essential in performing error-correcting, error-detecting and decoding tasks.
