About 56,000 results
Open links in new tab
  1. Hamming distance necessary for detecting d-bit error and for …

    Nov 3, 2014 · The Hamming distance between two binary strings of the same length is the number of bit positions where the string differ. But the important point to remember is that it is …

  2. Hamming distance required for error detection and correction

    The Hamming distance being 3 means that any two code words must differ in at least three bits. Suppose that 10111 and 10000 are codewords and you receive 10110.

  3. How to select numbers with the same Hamming distance under …

    Jan 13, 2025 · How to select numbers with the same Hamming distance under certain conditions? Ask Question Asked 11 months ago Modified 11 months ago

  4. algorithms - What is the difference between Hamming Distance …

    Nov 5, 2020 · What is the difference between Hamming Distance and Manhattan Distance for non-binary data (specifically I am comparing points in R2 R 2)? I understand Manhattan sums …

  5. Hamming distance and parity - Computer Science Stack Exchange

    The minimal distance of C C is the minimum Hamming distance between (different) codewords. Hamming codes have minimum distance 3, which means that (1) every two codewords differ …

  6. Understanding connection between length of codeword and …

    Mar 10, 2020 · Understanding connection between length of codeword and hamming distance in Hamming code Ask Question Asked 5 years, 7 months ago Modified 5 years, 7 months ago

  7. Compute minimum hamming distance of a code - Computer …

    3 How do you find the minimum hamming distance of a code? A naive way is computing the distance of each pair of codewords in our code. It becomes hard when the code is sufficiently …

  8. Is there a binary representation where the encoding distance …

    Mar 5, 2021 · 2 I need to binarily encode/decode small integers (around 10 bits), in such a way that the hamming distance of the encoded number grows monotonically with the (absolute …

  9. communication protocols - Difference between CRC and …

    Feb 28, 2016 · Both CRC and the Hamming code are binary linear codes. One significant difference is that the Hamming code only works on data of some fixed size (depending on the …

  10. computer networks - Hamming code distance and error detection ...

    Jul 12, 2019 · What is the maximum error rate under which error detection and retransmission mechanism (1 parity bit per block) is better than using Hamming code? Assume that bit errors …