One Error and in the Given Interval Two Error Correcting Code for the Additive Communication Channel
Abstract
In this paper error correcting codes in the additive noisy communication channel are discussed. The system of boolean equalities are examined based on the Hamming parity check matrix. The metrical properties of the solutions of that system of equalities are examined based on Hamming distance. It is constructed a code based on the set of the solutions of above mentioned system of boolean equalities and it is proved that the constructed code is correcting any single error and any two errors which occur in the given interval.
References
C.E. Shannon, “A mathematical theory of communication”, Bell System Technical Journal, 27(2). pp. 379-423 and 623-656, 1948.
R. W. Hamming, “Error Detecting and Error Correcting Codes”, Bell System Technical Journal, 29(2). pp. 147-160, 1950.
L. L. Peterson and B. S. Davis, Computer Networks: A Systems Approach. Morgan Kaufmann Publishers, San Francisco, 1996.
P. M. Chen, E. K. Lee, G. A. Gibson, R. H. Katz, and D. A. Patterson, “RAID: High performance, reliable secondary storage”, ACM Computing Surveys, 26(2). pp. 145-185, 1994.
C. L. Chen and M. Y. Hsiao, “Error-correcting codes for semiconductor memory applications: A state-of-the-art review”, IBM Journal of Research and Development, 28(2). pp. 124-134, 1984.
D. G. Chandler, E. P. Batterman, and G. Shah, “Hexagonal, information encoding article, process and system”, US Patent Number 4, pp. 874-936, 1989.
Ф. Дж. Мак-Вильямс, Теория кодов, исправляющих ошибки, 1979.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
