Scribd
Upload
264 views3 pages

Multiple Choice Questions

This document contains 10 multiple choice questions about BCH codes. BCH codes are an important class of linear block codes that can correct multiple errors. The questions cover topics like the minimum distance, error correction capability, and generator polynomials of BCH codes. A BCH code over GF(26) can correct up to 10 errors, and a (63,15) BCH code over GF(26) can correct up to 8 errors. The Hamming code is a special case of a BCH code with an error correcting capability of 1.

Uploaded by

Lochan Bisne
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
264 views3 pages

Multiple Choice Questions

This document contains 10 multiple choice questions about BCH codes. BCH codes are an important class of linear block codes that can correct multiple errors. The questions cover topics like the minimum distance, error correction capability, and generator polynomials of BCH codes. A BCH code over GF(26) can correct up to 10 errors, and a (63,15) BCH code over GF(26) can correct up to 8 errors. The Hamming code is a special case of a BCH code with an error correcting capability of 1.

Uploaded by

Lochan Bisne
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Multiple Choice Questions

1. One of the most important and powerful classes of the linear block codes are__________
codes
a. BCH
b. CRC
c. Golay
d. Reed-solomon
2. If t is the error-correction capability of BCH code, what is the minimum distance of the code?
a. 2t
b. 2t+1
c. 2t-1
d. None of the above
3. For BCH code, if the received vector and computed error vector are r(x) and e(x), then the error
free code vector can be calculated as
a. r(x) e(x)
b. r(x)/ e(x)
c. r(x)+ e(x)
d. None of the above
4. For (15,5) BCH code, if the roots of error location polynomial (x) are 2, 7 and 9, then error
polynomial e(x) is
a. x2+x7+x9
b. x6+x8+x13
c. x7+x12+x14
d. None of these
5. For a BCH code, if the minimal polynomials arei(x)(1i7), the generator polynomial g(x) of
triple error correction is
a. LCM{1(x) 2(x)
b. LCM{1(x) 3(x)
c. LCM{1(x) 2(x) 3(x)}
d. LCM{1(x) 3(x) 5(x)}

6. A BCH code over GF(26) can produce the code maximum error capability of
a. 6
b. 8
c. 10
d. 12
7. A (63,15) BCH code over GF(26) can produce the code maximum error capability of
a. 6
b. 8
c. 10
d. 12
8. For m=4, what is the block length of the BCH code?
a. 16
b. 15
c. 19
d. None of these
9. The ____ are powerful cyclic codes that can correct any number of error and can be designed
from the specification of the error-correcting capability.
a. CRC code
b. BCH code
c. RS code
d. Convolutional code
10. The _____ is a special case of BCH code whose error correcting ability is 1.
a. CRC code
b. Hamming code
c. RS code
d. Convolutional code

Solutions:
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.

A
B
C
B
D
C
B
B
B
B

You might also like