How many redundant bits are added in block codes for k information bits and n code bits?(a) n+k(b) n-k(c) k^2(d) n^2The question was asked at a job interview.My question is from Block Codes and Finite Fields topic in chapter Equalization, Diversity and Channel Coding of Wireless/Mobile

How many redundant bits are added in block codes for k information bit

1.	How many redundant bits are added in block codes for k information bits and n code bits?(a) n+k(b) n-k(c) k^2(d) n^2The question was asked at a job interview.My question is from Block Codes and Finite Fields topic in chapter Equalization, Diversity and Channel Coding of Wireless/Mobile
Answer» RIGHT option is (B) n-k The explanation is: In block encoder, k information bits are encoded into n code bits. A total of n-k redundant bits are added to the k information bits for the purpose of DETECTING and CORRECTING errors.

Discussion

No Comment Found

Related InterviewSolutions

Equalization is linear if an analog signal is fed back to change the subsequent outputs of the equalizer.(a) True(b) FalseThis question was addressed to me by my college professor while I was bunking the class.The above asked question is from Equalization Techniques topic in section Equalization, Diversity and Channel Coding of Wireless/Mobile
Equalizer is usually implemented in __________(a) Transmitter(b) Baseband or at IF in a receiver(c) Radio channel(d) Modulator stageThis question was posed to me by my college director while I was bunking the class.This question is from Fundamentals of Equalization in chapter Equalization, Diversity and Channel Coding of Wireless/Mobile
Which decoding method involves the evaluation by means of Fano’s algorithm?(a) Maximum Likelihood Decoding(b) Sequential Decoding(c) Maximum a priori(d) Minimum mean squareThe question was asked during an interview for a job.My question is taken from Convolutional Codes topic in division Equalization, Diversity and Channel Coding of Wireless/Mobile
CDPD stands for ___________(a) Cellular Digital Packet Data(b) Cellular Decoded Packet Data(c) Cellular Demodulated Packet Data(d) Cellular Decoded Plane DataThe question was posed to me in quiz.The question is from Block Codes and Finite Fields in division Equalization, Diversity and Channel Coding of Wireless/Mobile
Equalization techniques can be categorised into _______ and ______ techniques.(a) Linear, non linear(b) Active, passive(c) Direct, indirect(d) Slow, fastThis question was addressed to me in class test.Question is from Equalization Techniques in section Equalization, Diversity and Channel Coding of Wireless/Mobile
Frequency diversity uses ________ as a diversity element.(a) Correlation coefficient(b) Coherence time(c) Coherence bandwidth(d) SNRThis question was addressed to me by my college director while I was bunking the class.The origin of the question is Diversity Techniques in portion Equalization, Diversity and Channel Coding of Wireless/Mobile
Frequency diversity is implemented by transmitting information on more than one ___________(a) Carrier frequency(b) Amplitude(c) Phase(d) Modulation schemeThe question was posed to me during an internship interview.This intriguing question originated from Diversity Techniques in section Equalization, Diversity and Channel Coding of Wireless/Mobile
In comparison to stack algorithm, Fano’s algorithm is simpler.(a) True(b) FalseThe question was asked in final exam.Asked question is from Convolutional Codes in section Equalization, Diversity and Channel Coding of Wireless/Mobile
Which of the following algorithm uses simple programming?(a) LMS Gradient DFE(b) FTF algorithm(c) Fast Kalman DFE(d) Gradient Lattice DFEThe question was asked during an interview.Origin of the question is Algorithms for Adaptive Equalization topic in section Equalization, Diversity and Channel Coding of Wireless/Mobile
Convergence rate of LMS is fast.(a) True(b) FalseThe question was asked in an online interview.Asked question is from Algorithms for Adaptive Equalization topic in division Equalization, Diversity and Channel Coding of Wireless/Mobile

How many redundant bits are added in block codes for k information bits and n code bits?(a) n+k(b) n-k(c) k^2(d) n^2The question was asked at a job interview.My question is from Block Codes and Finite Fields topic in chapter Equalization, Diversity and Channel Coding of Wireless/Mobile

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment