Content deleted Content added
covering radius, intro |
m link: covering radius |
||
Line 11:
with respect to the Hamming [[metric]] around the codewords of ''C'' have to exhaust
the [[finite]] [[metric space]] <math>Q^n</math>.
The [[covering radius]] of a code ''C'' is the smallest ''R'' such that ''C'' is ''R''-covering.
Every [[perfect code]] is a covering code of minimal size.
|