ON ONE NEW ALGORITHM FOR CALCULATING HAMMING DISTANCES BETWEEN CODE WORDS

Authors

  • Kodirov Muzaffar Teachers of mathematics and computer science of the Shakhrikhan region. 44-specialized state secondary school., Uzbekistan
  • Valieva Dilnavoz Teachers of mathematics and computer science of the Shakhrikhan region. 44-specialized state secondary school., Uzbekistan
  • Nazhmiddinova Dilrabo Teachers of mathematics and computer science of the Shakhrikhan region. 44-specialized state secondary school., Uzbekistan

Keywords:

algorithm, Hamming distance, binary vectors, subroutine function, finite set, discrete set, subset

Abstract

In this paper, we propose a new algorithm for calculating Hamming distances between code words of binary codes that control errors. A comparative analysis of this algorithm with the traditional algorithm of the problem under consideration is given. Algorithms are described as functions in the C++ programming language

Downloads

Published

2020-06-11

Issue

Vol. 1 No. 1 (2020): IMSCIT-2020

Section

Articles

How to Cite

ON ONE NEW ALGORITHM FOR CALCULATING HAMMING DISTANCES BETWEEN CODE WORDS. (2020). Archive of Conferences, 1(1), 144-146. https://conferencepublication.com/index.php/aoc/article/view/53