“Ternary Golay code”的意思、由来-开放百科全书

词条

Ternary Golay code

释义

Properties
Ternary Golay code Extended ternary Golay code
History
See also
References

{{anchor|Perfect ternary Golay code}}{{infobox code
| name = Perfect ternary Golay code
| image =
| image_caption =
| namesake = Marcel J. E. Golay
| type = Linear block code
| block_length = 11
| message_length = 6
| rate = 6/11 ~ 0.545
| distance = 5
| alphabet_size = 3
| notation =

-code
}}{{infobox code
| name = Extended ternary Golay code
| image =
| image_caption =
| namesake = Marcel J. E. Golay
| type = Linear block code
| block_length = 12
| message_length = 6
| rate = 6/12 = 0.5
| distance = 6
| alphabet_size = 3
| notation =

-code
}}

In coding theory, the ternary Golay codes are two closely related error-correcting codes.

The code generally known simply as the ternary Golay code is an -code, that is, it is a linear code over a ternary alphabet; the relative distance of the code is as large as it possibly can be for a ternary code, and hence, the ternary Golay code is a perfect code.

The extended ternary Golay code is a [12, 6, 6] linear code obtained by adding a zero-sum check digit to the [11, 6, 5] code.

In finite group theory, the extended ternary Golay code is sometimes referred to as the ternary Golay code.{{citation missing|date=February 2013}}

Properties

Ternary Golay code

The ternary Golay code consists of 3⁶ = 729 codewords.

Its parity check matrix is

Any two different codewords differ in at least 5 positions.

Every ternary word of length 11 has a Hamming distance of at most 2 from exactly one codeword.

The code can also be constructed as the quadratic residue code of length 11 over the finite field F₃.

Used in a football pool with 11 games, the ternary Golay code corresponds to 729 bets and guarantees exactly one bet with at most 2 wrong outcomes.

The set of codewords with Hamming weight 5 is a 3-(11,5,4) design.

Extended ternary Golay code

The complete weight enumerator of the extended ternary Golay code is

The automorphism group of the extended ternary Golay code is 2.M₁₂, where M₁₂ is the Mathieu group M12.

The extended ternary Golay code can be constructed as the span of the rows of a Hadamard matrix of order 12 over the field F₃.

Consider all codewords of the extended code which have just six nonzero digits. The sets of positions at which these nonzero digits occur form the Steiner system S(5, 6, 12).

History

The ternary Golay code was discovered by {{harvs|txt|authorlink=Marcel J. E. Golay|last=Golay|year=1949}}. It was independently discovered two years earlier by the Finnish football pool enthusiast Juhani Virtakallio, who published it in 1947 in issues 27, 28 and 33 of the football magazine Veikkaaja. {{harv|Barg|1993|loc=p.25}}

References

{{Citation | last1=Barg | first1=Alexander | title=At the dawn of the theory of codes | doi=10.1007/BF03025254 |mr=1199273 | year=1993 | journal=The Mathematical Intelligencer | issn=0343-6993 | volume=15 | issue=1 | pages=20–26}}
M.J.E. Golay, Notes on digital coding, Proceedings of the I.R.E. 37 (1949) 657
I.F. Blake (ed.), Algebraic Coding Theory: History and Development, Dowden, Hutchinson & Ross, Stroudsburg 1973
J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, Springer, New York, Berlin, Heidelberg, 1988.
Robert L. Griess, Twelve Sporadic Groups, Springer, 1998.
G. Cohen, I. Honkala, S. Litsyn, A. Lobstein, Covering Codes, Elsevier (1997) {{ISBN|0-444-82511-8}}
Th. M. Thompson, From Error Correcting Codes through Sphere Packings to Simple Groups, The Mathematical Association of America 1983, {{ISBN|0-88385-037-0}}

3元ゴレイ符号

2 : Coding theory|Finite fields

随便看

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。

Properties

Ternary Golay code

Extended ternary Golay code

History

See also

References