diff --git a/doc/source/basicgameplay/codingcontracts.rst b/doc/source/basicgameplay/codingcontracts.rst
index 76bcaffbe..26f4e0528 100644
--- a/doc/source/basicgameplay/codingcontracts.rst
+++ b/doc/source/basicgameplay/codingcontracts.rst
@@ -286,7 +286,7 @@ The list contains the name of (i.e. the value returned by
 |                                         | | Treat it as a Hammingcode with 1 'possible' error on an random Index.                  |
 |                                         | | Find the 'possible' wrong bit, fix it and extract the decimal value, which is          |
 |                                         | | hidden inside the string.\n\n",                                                        |
-|                                         | | Note: The length of the binary string is dynamic, but it's encoding/decoding is        |
+|                                         | | Note: The length of the binary string is dynamic, but its encoding/decoding is         |
 |                                         | | following Hammings 'rule'\n",                                                          |
 |                                         | | Note 2: Index 0 is an 'overall' parity bit. Watch the Hammingcode-video from           |
 |                                         | | 3Blue1Brown for more information\n",                                                   |
diff --git a/src/data/codingcontracttypes.ts b/src/data/codingcontracttypes.ts
index c6e96c075..ed281cfa5 100644
--- a/src/data/codingcontracttypes.ts
+++ b/src/data/codingcontracttypes.ts
@@ -1320,7 +1320,7 @@ export const codingContractTypesMetadata: ICodingContractTypeMetadata[] = [
         `'${n}' \n\n`,
         "Treat it as an extended Hamming code with 1 'possible' error at a random index.\n",
         "Find the 'possible' wrong bit, fix it and extract the decimal value, which is hidden inside the string.\n\n",
-        "Note: The length of the binary string is dynamic, but it's encoding/decoding follows Hamming's 'rule'\n",
+        "Note: The length of the binary string is dynamic, but its encoding/decoding follows Hamming's 'rule'\n",
         "Note 2: Index 0 is an 'overall' parity bit. Watch the Hamming code video from 3Blue1Brown for more information\n",
         "Note 3: There's a ~55% chance for an altered Bit. So... MAYBE there is an altered Bit 😉\n",
         "Note: The endianness of the encoded decimal value is reversed in relation to the endianness of the Hamming code. Where",