# Questions tagged [hamming-distance]

The tag has no usage guidance.

29 questions
Filter by
Sorted by
Tagged with
79 views

30 views

### Encoding and Decoding

I am trying to find an encoding function e:{0,1}^20→{0,1}^10 and a decoding function d:{0,1}^10→{0,1}^20. Goal is to find d and e so that maxBdH(d(e(B)),B) is as small as possible. Here, dH denotes ...
57 views

1 vote
25 views

### Number of binary words that form a group of Hamming weight at most d

Consider binary words in {0,1}^n whose Hamming weight is at most some constant d. We want to select some of these words such that they form a group under addition. How many words can we choose at most?...
30 views

### What is the best learning to hashing for embedding points in a Vector Space in Hamming Space?

I have a cloud of points in $\mathbb{R}^n$ and I want to embed them in Hamming Space. One possible solution is for example found in Inductive Hashing on Manifolds. The problem is: I need an extremely ...
• 137
1 vote
135 views

### What is the intuition behind working of hamming codes

I am trying to understand hamming codes for single bit error correction. I understood all the things like hamming distance , k bit error detection and all basics for hamming codes. Also, I know the ...
47 views

### Hierarchial clustering cannonnical representation?

I have to handle large binary dataset. That is one of the reasons I have to build my own Hierarchical Clustering. As I digged into the algorithms I was surprised and not ;) to find that it is possible ...
• 139
236 views

### How to recognise the number of errors that can be detected and corrected of a large set of codewords (k) each having a specified number of bits (n)?

I am struggling to find how can I know the number of errors that can be corrected and detected using (n=10) bit code with a (k=550) codewords. As far as I know, to calculate the number of errors to be ...
110 views

### Travelling Salesman Problem: Distance between solutions

I'm designing a genetic algorithm to solve the travelling salesman problem. So far, I've gotten fairly good results. I'm now trying to improve on them by implementing some sort of diversification ...
• 101
83 views

• 41
140 views

### Largest set of 10-digit numbers where none have Hamming Distance = 1 with any other

I'm working on a system that will require manual data entry of 10-digit numbers (Σ = 0123456789). To help prevent data errors, I want to avoid generating any two ...
• 95
1 vote
228 views

### Channel coding and Error probability. Where are these probabilities from?

From where are the following probabilities? We consider BSCε with ε = 0,1 and block code C = {c1, c2} with the code words c1 = 010 and c2 = 101. On the received word y we use the decoder D = {D1,D2} ...
• 51
1 vote
681 views

### Why ASCII letter A has a Hamming Distance of 3?

My question is what does [this construction gives a Hamming Distance a distance of 3] means? Why the Hamming Distance of ASCII letter A is 3? How do you determine the Hamming Distance is 3? This is ...
522 views

### Understanding connection between length of codeword and hamming distance in Hamming code

I came across following in Huffman coding: Minimum Hamming distance to correct up to s errors is $2s + 1$ because that way the legal codewords are so far apart that even with $s$ changes the ...
• 1,637
1 vote
275 views

### Effects of parity bit on odd code length regarding its size after alternation

I am trying to understand code distance, but I am not sure regarding the following scenario: Assume that you have an information word M with m bits, that You code into a coding word using the ...
• 11
1 vote
26 views

### finding amount of errors that can be fixed based on code length [closed]

i tried to look online and search this site and others but haven't found any good explanation to the following simple question: how many errors can a code with length k(k>2)fix?
42 views

### minimal distance of a self correcting code

i wonder: how can i find minimal distance of a self correcting code in following situation: if we know that a code can fix every 3 errors(if not more than 3 errors, the word is recovered) and can ...
568 views

### Hamming code distance and error detection

Suppose that data are transmitted in blocks of sizes 1000 bits. What is the maximum error rate under which error detection and retransmission mechanism (1 parity bit per block) is better than using ...
185 views

### Covering radius of a code in the Hamming space

A deterministic $(2−2/(k+1))^n$ algorithm for $k$-SAT based on local search 　I have read this paper and I couldn't understand how to culculate the $covering$ $radius$ of a code in the Hamming space. ...
• 59
931 views

### Find binary number with max hamming distance wrt given set of binary numbers

Suppose we have a set $A$ of binary numbers with the same length $n$. For example (with $n=8$): $A = \{ 10010011, 01011011, 00010010, 11110001\}$ Now, I want to find the binary number $z$ (also with ...
58 views

### finding the overhead and distance of an unknown code based on message making algorithm

for an information word M with m bits that is coded as following: M is coded into a word A using an unknown code that allows detection of not more than one error. the code word is the word obtained ...
• 101
566 views

### How does this answer for automata and Hamming distance not lead to inconsistencies?

I had already been given the answer by the TA in class, but I don't understand it. I'm not asking for the answer on a homework problem or anything. The problem: The Hamming distance ("distance") of ...
• 21
201 views

### Minimum number of strings to cover entire space within Hamming distance

Given $(n, k)$: What is the minimum number $x$ of (binary) strings such that all $n$-bit (binary) strings are within $k$ Hamming distance of some string? Is there an asymptotic expansion or lower ...
• 1,393
I was reading about CRC coding from two books: Data Communication and Networking by Forouzan Page 294 Computer Network by Tanenbaum Page 188 They use following notations: $d(x)$: dataword to be ...