Covering code: Difference between revisions

Revision as of 22:06, 26 January 2012

Revision as of 03:06, 2 February 2012

Line 1:

In [[coding theory]], a '''covering code''' is an object satisfying a certainset mathematicalof property:elements A code of length(called ''ncodewords'') overin ''Q''a isspace, anwith ''R''-coveringthe codeproperty if forthat every wordelement of <math>Q^n</math>the therespace is within a codeword such that their [[Hammingfixed distance]] isof <math>\lesome R</math>codeword.

<math>ERf</math>== Definition ==

Let <math>q\geq 2</math>, <math>n\geq 1</math>, <math>R\geq 0</math> be [[integers]].