The Gateway to Computer Science Excellence
0 votes
53 views

Consider a simple code $\mathcal{C}$ for error detection and correction. Each codeword in $\mathcal{C}$ consists of $2$ data bits $[d_1, d_0]$ followed by check bits $[c_2, c_1, c_0]$. The check bits are computed as follows: $c_2 = d_1+d_0, \: c_1=d_1$ and  $c_0=d_0$, where $'+'$ is a modulo-$2$ addition.

  1. Write down all the codewords for $\mathcal{C}$
  2. Determine the minimum Hamming distance between any two distinct codewords of $\mathcal{C}$
in Digital Logic by Boss (42.5k points)
edited by | 53 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,382 answers
198,529 comments
105,323 users