Revision as of 07:58, 14 May 2015 edit Primaler (talk \| contribs) Extended confirmed users 8,364 edits m dab ← Previous edit		Revision as of 20:53, 12 October 2015 edit undo Klbrain (talk \| contribs) Autopatrolled, Extended confirmed users, New page reviewers 97,814 edits m Disambiguated: lower and upper bounds → upper and lower bounds Next edit →
Line 20: == Covering problem == The [[determination]] of the minimal size <math>K_q(n,R)</math> of a ''q''-ary ''R''-covering code of length ''n'' is a very hard problem. In many cases, only ~~lower~~[[upper and ~~upper~~lower [[bounds]] are known with a large gap between them. Every construction of a covering code gives an upper bound on ''K''<sub>''q''</sub>(''n'', ''R''). Lower bounds include the sphere covering bound and

Covering code: Difference between revisions