Revision as of 19:26, 24 May 2008 edit Michael Hardy (talk \| contribs) Administrators 210,577 edits m →Covering problem ← Previous edit		Revision as of 19:27, 24 May 2008 edit undo Michael Hardy (talk \| contribs) Administrators 210,577 edits m →Example Next edit →
Line 15: == Example == ''C'' =\ {0134,0223,1402,1431,1444,2123,2234,3002,3310,4010,4341\} is a 5-ary 2-covering code of length 4.<ref>P.R.J. Östergård, Upper bounds for ''q''-ary covering codes, ''[[IEEE Transactions on Information Theory]]'', 37 (1991), 660-664</ref> == Covering problem ==

Covering code: Difference between revisions