The Hamming distance dist(u, v) between two binary vectors
$30-250 USD
Paid on delivery
The Hamming distance dist(u, v) between two binary vectors v = (v1, . . . , vn) and w = (w1, . . . , wn) is the number of indices k such that vk 6= wk. A fundamental question in coding theory is to determine the
number A(n, d) = max |{S ⊂ {0, 1} n | dist(u, v) ≥ d for all distinct u, v ∈ S}|,
the maximal number of binary vectors of length n that one can find such that any
two distinct vectors have a Hamming distance ≥ d. For example, A(5, 4) = 2.
The Hamming graph H(n, d) = (V, E) is the graph with 2n vertices V given by
binary strings of length n. We have (u, v) ∈ E if and only if dist(u, v) ≥ d.
The number A(n, d) coincides with the size of a maximal clique in H(n, d).
Find an implement “efficient” algorithms to compute the maximal clique in the
Hamming graph (but note that the problem to compute maximal cliques is NP
hard).
Project ID: #23949524
About the project
7 freelancers are bidding on average $97 for this job
Hi There, I've reviewed your requirements, I am very interested in your post project. I'm excited with feeling that I would be able to satisfy your requirements in this job. Please leave a message on my chat so we can More
i have well experienced in doing such kind of jobs......................... . .... . ........
Hey. I have more than 3 years of experience programming in Python. I also have experience in Graph theory and Coding theory. I can complete the project in less than 3 days. Feel free to contact me. Thank you.