Mathematics Tripos Papers

  • Part IA
  • Part IB
  • Part II
  • FAQ

Paper 4, Section I, I

Coding and Cryptography | Part II, 2014

Explain what is meant by a Bose-Ray Chaudhuri-Hocquenghem (BCH) code with design distance δ\deltaδ. Prove that, for such a code, the minimum distance between code words is at least δ\deltaδ. How many errors will the code detect? How many errors will it correct?

Typos? Please submit corrections to this page on GitHub.