What Is the Maximum Possible Hamming Distance Between Two Nodes in an n-Cube?

  • Thread starter Thread starter koko20
  • Start date Start date
  • Tags Tags
    Formula
Click For Summary
SUMMARY

The maximum possible Hamming distance between two nodes in an n-cube can be determined by analyzing the levels of the nodes. A node at level i has i 1s and n-i 0s. The Hamming distance is defined as the number of differing bits between two binary strings. For example, the Hamming distance between the strings 100 and 011 is 3, indicating that they differ in three positions. Understanding the properties of Hamming distance and experimenting with various values of n and i will lead to a clearer formula.

PREREQUISITES
  • Understanding of Hamming distance
  • Familiarity with n-cubes and binary representations
  • Basic combinatorial principles
  • Experience with mathematical proofs and problem-solving
NEXT STEPS
  • Research the properties of Hamming distance in coding theory
  • Explore combinatorial methods for calculating distances in n-cubes
  • Investigate the relationship between node levels and Hamming distance
  • Practice deriving formulas for maximum Hamming distances in various dimensions
USEFUL FOR

Students studying computer science, particularly those focusing on coding theory, graph theory, or discrete mathematics, as well as educators looking for examples of Hamming distance applications.

koko20
Messages
1
Reaction score
0
Hey

Homework Statement



can someone please help me with this question as i have no idea how to go about it to make a formula for this question.

What is the maximum possible Hamming distance between
two nodes from level i in an n-cube?

If a node in an n-cube has i 1s and n-i 0s in its coordinate, we say that
it is from level i.

Homework Equations


i don't know what the equation is as the question is asking to come up with the equation as an answer.

The Attempt at a Solution


this is what i know:
Hamming distance = (100,011)=3
but i don't know how to make a formula for this

many thankx for your help.
koko20
 
Physics news on Phys.org
I'm no expert on Hamming distances, but I would play around with n = 5 and n = 6 and try various values for i to see how large you can make the Hamming distance. I think the answer and how to prove it will become clear.
 
koko20 said:
Hey

Homework Statement



can someone please help me with this question as i have no idea how to go about it to make a formula for this question.

What is the maximum possible Hamming distance between
two nodes from level i in an n-cube?

If a node in an n-cube has i 1s and n-i 0s in its coordinate, we say that
it is from level i.

Homework Equations


i don't know what the equation is as the question is asking to come up with the equation as an answer.

The Attempt at a Solution


this is what i know:
Hamming distance = (100,011)=3
but i don't know how to make a formula for this

many thankx for your help.
koko20

You have given the Hamming distance for the strings 100 and 011. These are strings in a 3-cube, but from your description, they are from different nodes, and are at different levels.

Two strings at the same level would be 101 and 011. They both have two 1's and one 0.

How does your book define Hamming distance? (You can also do a search on wikipedia for this term.)

I don't think you'll need a formula for the maximum possible Hamming distance. If you understand what this term means, you'll be able to come up with the answer.
 

Similar threads

Replies
15
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
Replies
3
Views
2K
  • · Replies 16 ·
Replies
16
Views
2K
Replies
5
Views
3K
  • · Replies 15 ·
Replies
15
Views
4K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 14 ·
Replies
14
Views
4K