The Gateway to Computer Science Excellence

0 votes

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.

- Write down all the codewords for $\mathcal{C}$
- Determine the minimum Hamming distance between any two distinct codewords of $\mathcal{C}$

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.5k
- Others 1.5k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,650 questions

56,242 answers

194,294 comments

95,949 users