felixfoertsch/bitburner-src
1
0
Fork 0
mirror of https://github.com/bitburner-official/bitburner-src.git synced 2026-04-16 06:18:42 +02:00
Code Issues Packages Projects Releases Wiki Activity

CONTRACT: Clarify applicibility of wiki entry in Hamming contracts (#2087)

Browse Source
This commit is contained in:
gmcew
2025-04-13 22:10:25 +01:00
committed by GitHub
parent af6583cd26
commit d592e07719
1 changed files with 13 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
src/CodingContract/contracts/HammingCode.ts
View File

@@ -15,18 +15,20 @@ export const hammingCode: Pick<
`${n} \n\n`,
"Convert it to a binary representation and encode it as an 'extended Hamming code'.\n ",
"The number should be converted to a string of '0' and '1' with no leading zeroes.\n",
"A parity bit is inserted at position 0 and at every position N where N is a power of 2.\n",
"An 'extended Hamming code' has an additional parity bit to enhance error detection.\n",
"A parity bit is inserted at every position N where N is a power of 2, with the additional parity bit at position 0.\n",
"Parity bits are used to make the total number of '1' bits in a given set of data even.\n",
"The parity bit at position 0 considers all bits including parity bits.\n",
"Each parity bit at position 2^N alternately considers 2^N bits then ignores 2^N bits, starting at position 2^N.\n",
"Each parity bit at position 2^N alternately considers N bits then ignores N bits, starting at position 2^N.\n",
"The additional parity bit at position 0 considers all bits including parity bits.\n",
"The endianness of the parity bits is reversed compared to the endianness of the data bits:\n",
"Data bits are encoded most significant bit first and the parity bits encoded least significant bit first.\n",
"The parity bit at position 0 is set last.\n\n",
"The additional parity bit at position 0 is set last.\n\n",
"Examples:\n\n",
"8 in binary is 1000, and encodes to 11110000 (pppdpddd - where p is a parity bit and d is a data bit)\n",
"21 in binary is 10101, and encodes to 1001101011 (pppdpdddpd)\n\n",
"For more information on the 'rule' of encoding, refer to Wikipedia (https://wikipedia.org/wiki/Hamming_code)",
"or the 3Blue1Brown videos on Hamming Codes. (https://youtube.com/watch?v=X8jsijhllIA)",
"or the 3Blue1Brown videos on Hamming Codes. (https://youtube.com/watch?v=X8jsijhllIA)\n",
"NOTE: The wikipedia entry does not cover the specific 'extended Hamming code' structure used in this contract.",
].join(" ");
},
generate: (): number => {
@@ -48,13 +50,14 @@ export const hammingCode: Pick<
`'${n}' \n\n`,
"Decode it as an 'extended Hamming code' and convert it to a decimal value.\n",
"The binary string may include leading zeroes.\n",
"A parity bit is inserted at position 0 and at every position N where N is a power of 2.\n",
"An 'extended Hamming code' has an additional parity bit to enhance error detection.\n",
"A parity bit is inserted at every position N where N is a power of 2, with the additional parity bit at position 0.\n",
"Parity bits are used to make the total number of '1' bits in a given set of data even.\n",
"The parity bit at position 0 considers all bits including parity bits.\n",
"Each parity bit at position 2^N alternately considers 2^N bits then ignores 2^N bits, starting at position 2^N.\n",
"The additional parity bit at position 0 considers all bits including parity bits.\n",
"The endianness of the parity bits is reversed compared to the endianness of the data bits:\n",
"Data bits are encoded most significant bit first and the parity bits encoded least significant bit first.\n",
"The parity bit at position 0 is set last.\n",
"The additional parity bit at position 0 is set last.\n",
"There is a ~55% chance for an altered bit at a random index.\n",
"Find the possible altered bit, fix it and extract the decimal value.\n\n",
"Examples:\n\n",
@@ -62,7 +65,8 @@ export const hammingCode: Pick<
"'1001101010' fails the parity checks and needs the last bit to be corrected to get '1001101011',",
"after which the data bits are found to be 10101, which is 21 in binary.\n\n",
"For more information on the 'rule' of encoding, refer to Wikipedia (https://wikipedia.org/wiki/Hamming_code)",
"or the 3Blue1Brown videos on Hamming Codes. (https://youtube.com/watch?v=X8jsijhllIA)",
"or the 3Blue1Brown videos on Hamming Codes. (https://youtube.com/watch?v=X8jsijhllIA)\n",
"NOTE: The wikipedia entry does not cover the specific 'extended Hamming code' structure used in this contract.",
].join(" ");
},
generate: (): string => {