• Home
  • Textbooks
  • Foundations of coding: theory and applications of error-correcting codes
  • BCH Codes: Strong Codes Correcting Multiple Errors

Foundations of coding: theory and applications of error-correcting codes

Jiri Adamek

Chapter 12

BCH Codes: Strong Codes Correcting Multiple Errors - all with Video Answers

Educators


Chapter Questions

Problem 1

Using the BCH code of Example (1) in 12.2, decode the words
(1) 00000111000000 ,
(2) 11000100000001 .

Check back soon!

Problem 2

Describe the binary double-error-correcting code of length 11.

Check back soon!

Problem 3

What is the information rate of the double-error-correcting $\mathrm{BCH}$ code of length 31
(1) over $\mathbf{Z}_2$ ?
(2) over $\mathbf{Z}_3$ ?

Check back soon!

Problem 4

Find the generator and parity check polynomials for the binary triple-error-correcting $\mathrm{BCH}$ code of length
(1) 15 ,
(2) 31 .
Encode the information word consisting of all l's.

Check back soon!

Problem 5

Prove the independence theorem (see 12.2) for the $t$-error-correcting BCH codes.

Check back soon!

Problem 6

Using Reed-Solomon codes, construct a binary (75, 28)-code correcting burst errors of length 11 and a $(75,40)$-code correcting burst errors of length 6 .

Check back soon!

Problem 7

For $r(x)=x^{2 t}$, show that $\frac{1}{x-a}=\sum_{j=1}^{2 t} a^{-j} x^{j-1}$. Use this to verify again that the Goppa code determined by $x^{2 t}$ and all nonzero elements $\alpha^0, \alpha^{-1}, \ldots, \alpha^{-(n-1)}$ of the extension field is precisely the BCH code.

Check back soon!

Problem 8

Find the minimum distance of the binary Goppa code determined by $r(x)=x^2+1$ and by the elements $0, z, z^2$ of $G F(4)$. Compare this with Theorem 12.5.

Check back soon!

Problem 9

Find a parity check matrix of the irreducible binary (16,8)-Goppa code given by $r(x)=x^2+x+\alpha^3$, where $\alpha$ is primitive in $G F(16)$.

Check back soon!

Problem 10

Verify that the polynomial $x^2+x+1$ is irreducible over $G F(32)$. Find the parameters and parity check matrix of the corresponding irreducible Goppa code.

Check back soon!