Skip to content

Commit e9d35aa

Browse files
Merge branch 'branch1' of github.com:AyushChakraborty/TheAlgorithms into branch1
2 parents 4de7668 + b720b7a commit e9d35aa

File tree

1 file changed

+3
-3
lines changed

1 file changed

+3
-3
lines changed

bit_manipulation/hamming_code_generator.py

+3-3
Original file line numberDiff line numberDiff line change
@@ -10,12 +10,12 @@
1010

1111
def hamming_15_11(number: str) -> str:
1212
"""
13-
Performs parity checks to assign values to the redundant bits,
13+
Performs parity checks to assign values to the redundant bits,
1414
in the 16 bit number
1515
returned, bits at index 0, 1, 2, 4, 8 are redundant bits used for checking
1616
17-
Hamming generated 16 bits generated from the 11 bit binary number can only detect
18-
and change a single bit change, but can only detect more than a
17+
Hamming generated 16 bits generated from the 11 bit binary number can only detect
18+
and change a single bit change, but can only detect more than a
1919
single bit change
2020
2121
for more theoretical knowledege about Hamming codes, refer:

0 commit comments

Comments
 (0)