Recent content by asdf1234
-
A
Undergrad Calculating Hamming Distances in 5-Bit Binary Sets
This seems like an interesting approach. The only problem I can see running into is how to determine how many pairs have been discovered with each element 'close' to A or B. I guess it would be the number 'close' plus 1 (A or B) choose 2, but how would I know the total amount? Would I have to do...- asdf1234
- Post #5
- Forum: Linear and Abstract Algebra
-
A
Undergrad Calculating Hamming Distances in 5-Bit Binary Sets
Hello, I'm working on a proof and I would like some help. I need to show that any set of 6 distinct 5-bit binary numbers must have at least 5 distinct pairs of elements with Hamming distance less than or equal to 2. Hamming distance is the sum of the absolute value of each pair of coordinates...- asdf1234
- Thread
- Replies: 9
- Forum: Linear and Abstract Algebra
-
A
Undergrad What is the Solution to Finding a Set of n+1 Integers from 2n?
[deleted by user]- asdf1234
- Post #3
- Forum: Linear and Abstract Algebra
-
A
Undergrad What is the Solution to Finding a Set of n+1 Integers from 2n?
[SOLVED] Set of n+1 integers from 2n [deleted by user]- asdf1234
- Thread
- Integers Set
- Replies: 2
- Forum: Linear and Abstract Algebra