✦ LIBER ✦

A Z8-linear lift of the binary Golay code and a nonlinear binary (96,237,24)-code

✍ Scribed by Duursma, I.M.; Greferath, M.; Litsyn, S.N.; Schmidt, S.E.

Book ID: 114541918
Publisher: IEEE
Year: 2001
Tongue: English
Weight: 87 KB
Volume: 47
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.923742

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Group Ring Construction of the Extende

A Group Ring Construction of the Extended Binary Golay Code

✍ McLoughlin, I.; Hurley, T. 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 126 KB

A new construction of the binary golay c

A new construction of the binary golay code (24, 12, 8) using a group algebra over a finite field

✍ J. Wolfmann 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 178 KB

A New Lower Bound on the Minimal Length

A New Lower Bound on the Minimal Length of a Binary Linear Code

✍ M.C. Bhandari; M.S. Garg 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 256 KB

A sharpening of the Johnson bound for bi

A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with preparata parameters

✍ A. E. Brouwer; L. M. G. M. Tolhuizen 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 163 KB

An algorithm for calculating the exact b

An algorithm for calculating the exact bit error probability of a binary linear code over the binary symmetric channel

✍ Wadayama, T. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 290 KB

On the dual distance and the gap of a bi

On the dual distance and the gap of a binary code

✍ Patrick Solé; Jean-Pierre Tillicb 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 258 KB

The coset graph of a nondegenerate cyclic code is orbital regular. This yields a lower bound on its average distance, a parameter which measures the average distortion of a code used in data compression. Using results of Shahrokhi and Sz&kely we generalize this bound to binary codes with a transitiv