Given data word $M$ of $2n$ bits $M$ is split into 2 words $M_1M_2$ whereas the length of $M_1$ is $n$ bits as well as the length of $M_2$ is also $n$ bits. $M_1$ and $M_2$ are encoded separately using Hamming code and result in words $K_1$ and $K_2$ respectively. The final result is the conca...

For a data word of $16$ bits which is the most correct claim: Hamming code extra bits overhead will be greater than CRC because Hamming code corrects one error while CRC can only detect errors. CRC extra bits overhead is greater because Hamming code uses minimal number of bits for en...

What is the minimal Hamming distance of $12$-error detecting code and $8$-error correcting code? We know that a code is said to be $x$ error detecting if, and only if, the minimum Hamming distance between any two of its codewords is at least $x+1$ ($13$ in our case). In addition a code is $y$-e...

A word $M$ is of $n^2$ bits, $n>3$ is arranged in a $n\times n$ matrix. $A$ is the main diagonal of the matrix (that is elements $a_{i,j}$, $i=j$) and is encoded with Hamming code, resulting in $B$. The final result transmitted is word $M$ concatenated with $B$ (let us call it $R$). What is the ...