• recategorized by
1,067 views
0 0 votes

A linear Hamming code is used to map $4-bit$ message to $7-bit$ codewords. The encoder mapping is linear. If the message $0001$ is mapped to the codeword $0000111$, and the message $0011$ is mapped to the codeword $1100110$, then the message $0010$ is mapped to

  1. $0010011$
  2. $1100001$
  3. $1111000$
  4. $1111111$

Please log in or register to answer this question.

Answer:
Position:
Show:

Related questions

0 0 votes
0 0 answers
457
457 views
gatecse asked Feb 19, 2018
457 views
Consider a binary channel code in which each codeword has a fixed length of $5\: bits$. The Hamming distance between any pair of distinct codewords in this code is at le...
0 0 votes
0 0 answers
649
649 views
Arjun asked Feb 12, 2019
649 views
A single bit, equally likely to be $0$ and $1$, is to be sent across an additive white Gaussian noise (AWGN) channel with power spectral density $N_{0}/2.$ Binary signali...
0 0 votes
0 0 answers
497
497 views
Arjun asked Feb 12, 2019
497 views
Let a random process $Y(t)$ be described as $Y(t)=h(t) \ast X(t)+Z(t),$ where $X(t)$ is a white noise process with power spectral density $S_{x}(f)=5$W/Hz. The filter $h(...
0 0 votes
0 0 answers
557
557 views
Arjun asked Feb 12, 2019
557 views
A voice signal $m(t)$ is in the frequency range $5\:kHz$ to $15\:kHz$. The signal is amplitude-modulated to generated an AM signal $f(t)=A\left(1+m(t)\right)\cos 2\pi f_{...

Add Synced Question

×