✦ LIBER ✦

Reconstructing the ternary Golay code

✍ Scribed by Donald Y Goldberg

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 155 KB
Volume: 42
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(86)90100-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The extended golay codes considered as i

The extended golay codes considered as ideals

✍ Frank Bernhardt; Peter Landrock; Olaf Manz 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 569 KB

More on the uniqueness of the Golay code

More on the uniqueness of the Golay codes

✍ Vera Pless 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 533 KB

Pless, V., More on the uniqueness of the Golay codes, Discrete Mathematics 106/107 (1992) 391-398. If c?' is a set of 3" ternary vectors of length 12, distance ~6, containing 0, then we show that the supports of the weight 6 vectors in C hold an S(5, 6, 12). Further we show that C must be a linear,

New 5-designs constructed from the lifte

New 5-designs constructed from the lifted Golay code over ℤ4

✍ Masaaki Harada 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB

It is shown that the lifted Golay code over Z4 contains several 5-designs. In particular, a 5-(24, 12, 1584) design and a 5-(24, 12, 1632) design are constructed for the first time.

Fast decoding of the (23, 12, 7) Golay c

Fast decoding of the (23, 12, 7) Golay code with four-error-correcting capability

✍ Chu, Shao-I ;Lee, Hung-Peng ;Chang, Hsin-Chiu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 832 KB

On the reconstruction of linear codes

✍ Philip Maynard; Johannes Siemons 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB 👁 2 views

For a linear code over GF (q) we consider two kinds of ''subcodes'' called residuals and punctures. When does the collection of residuals or punctures determine the isomorphism class of the code? We call such a code residually or puncture reconstructible. We investigate these notions of reconstructi

The nonexistence of ternary [79,6,51] co

The nonexistence of ternary [79,6,51] codes

✍ Noboru Hamada; Yoko Watamori 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 143 KB

It is known (cf. Hamada, J. Combin. Inform. System Sci. 18 (1993b) that there is no ternary [78,6,51] code meeting the Griesmer bound and n 3(6; 51) = 79 or 80, where n3(k; d) denotes the smallest value of n for which there exists a ternary [n; k; d] code.