Open Vedansh-Keshari opened 10 months ago
Kindly elaborate with an example
I'd love to be briefed about this. Im interested
I would like to contribute in this....
@SarthakKeshari Sorry for the inconvenience faced. @SarthakKeshari @sikehish @sachinsingh2020 Please check the updated issue.
Could you share the link to the updated issue
@sikehish, The description of this very issue has been updated.
Hey @sachinsingh2020, Assigned.
You may contribute your code under the folder path -
Issue completion deadline - 30th Oct 9:00:00 am IST
NOTE - In case the issue completion deadline is not met, the issue will be assigned to a new participant
I apologize for the delay in my response, and I appreciate your understanding.
@sachinsingh2020, Since the issue completion deadline is crossed, Issue has been unassigned.
Enter calculator name -
Calculator giving Points with Minimum Hamming Distance
Describe calculator functionality -
The Calculator giving Points with Minimum Hamming Distance takes the input of a number of points in the format of binary Strings and gives two or more points as output ( using their Hamming weights ) which have the minimum hamming distance between them as sets like ( pt , p2 ) , etc. For example, Suppose pt is provided as 10100 and the points p1 = 00000 , p2 = 00101 , p3 = 00111 , p4 = 01010 , p5 = 01011 the hamming weights of points p1, p2, p3, p4 and p5 with respect to pt, will be calculated using XOR ( π€ ) and the values come out to be : π€ ( pt , p1 ) = 10100 --> wt. = 2 π€ ( pt , p2 ) = 10001 --> wt. = 2 π€ ( pt , p3 ) = 10011 --> wt. = 3 π€ ( pt , p4 ) = 11110 --> wt. = 4 π€ ( pt , p5 ) = 11111 --> wt. = 5 Thus, as we can see there is no minimum of the hamming distances as there are two values in reference to the point pt that have a distance of 2 .
Under which category you wish to place it -