Covering code: Difference between revisions

Revision as of 15:09, 18 June 2024

Latest revision as of 15:14, 18 June 2024

(One intermediate revision by the same user not shown)

Line 16:

== Example ==

''C'' = {0134,0223,1402,1431,1444,2123,2234,3002,3310,4010,4341} is a 5-ary 2-covering code of length 4.<ref>{{cite journal |author=P.R.J. Östergård, |title=Upper bounds for ''q''-ary covering codes, ''|journal=[[IEEE Transactions on Information Theory]]'', |volume=37 (|year=1991), |pages=660-664}}</ref>

== Covering problem ==

Line 98:

== Applications ==

The standard work<ref>{{cite book |author=G. Cohen, I. Honkala, S. Litsyn, A. Lobstein, ''|title=Covering Codes'', |publisher=[[Elsevier]] (|year=1997) {{ISBN|isbn=0-444-82511-8}}</ref> on covering codes lists the following applications.

*Compression with [[distortion]]

Line 104:

*[[Code|Decoding]] errors and erasures

*[[Broadcasting]] in interconnection networks

*[[Football pools]]<ref>{{cite journal |author=H. Hämäläinen, I. Honkala, S. Litsyn, P.R.J. Östergård, |title=Football pools -— a game for mathematicians, ''|journal=[[American Mathematical Monthly]]'', |volume=102 (|year=1995), |pages=579-588}}</ref>

*Write-once memories

*Berlekamp-Gale game

Line 113:

==References==

{{reflist|colwidth=30em}}

<references/>

== External links ==