A Brief Survey of Covering Radius

This publication has 13 references indexed in Scilit:

• The Covering Radius of the $(m - 3)$rd Order Reed Muller Codes and a Lower Bound on the $(m - 4)$th Order Reed Muller Codes
  SIAM Journal on Applied Mathematics, 1979
• No primitive binaryt-error-correcting BCH code witht > 2is quasi-perfect (Corresp.)
  IEEE Transactions on Information Theory, 1979
• All binary 3-error-correcting BCH codes of length2^m-ihave covering radius 5 (Corresp.)
  IEEE Transactions on Information Theory, 1978
• Some 3-error-correcting BCH codes have covering radius 5 (Corresp.)
  IEEE Transactions on Information Theory, 1976
• Anent codes, priorities, patents, etc.
  Proceedings of the IEEE, 1976
• Complete decoding of triple-error-correcting binary BCH codes
  IEEE Transactions on Information Theory, 1976
• Four fundamental parameters of a code and their combinatorial significance
  Information and Control, 1973
• Weight distributions of the cosets of the (32,6) Reed-Muller code
  IEEE Transactions on Information Theory, 1972
• Two-error correcting Bose-Chaudhuri codes are quasi-perfect
  Information and Control, 1960
• Error Detecting and Error Correcting Codes
  Bell System Technical Journal, 1950