✦ LIBER ✦

A binary perfect code of length 15 and codimension 0

✍ Scribed by Olof Heden

Book ID: 105174022
Publisher: Springer
Year: 1994
Tongue: English
Weight: 288 KB
Volume: 4
Category: Article
ISSN: 0925-1022
DOI: 10.1007/bf01388453

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On enumeration of nonequivalent perfect

On enumeration of nonequivalent perfect binary codes of length 15 and rank 15

✍ S. A. Malyugin 📂 Article 📅 2007 🏛 Pleiades Publishing 🌐 English ⚖ 610 KB

Binary Perfect Codes of Length 15 by the

Binary Perfect Codes of Length 15 by the Generalized Concatenated Construction

✍ V. A. Zinoviev; D. V. Zinoviev 📂 Article 📅 2004 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 172 KB

Binary perfect and extended perfect code

Binary perfect and extended perfect codes of lengths 15 and 16 and of ranks 13 and 14

✍ V. A. Zinoviev; D. V. Zinoviev 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 284 KB

Binary extended perfect codes of length

Binary extended perfect codes of length 16 and rank 14

✍ V. A. Zinoviev; D. V. Zinoviev 📂 Article 📅 2006 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 426 KB

ASIC implementation of a programmable er

ASIC implementation of a programmable error-trapping decoder for binary codes of length 15

✍ AEA Almaini; SS Aziz 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 536 KB

There exist Steiner triple systems of or

There exist Steiner triple systems of order 15 that do not occur in a perfect binary one-error-correcting code

✍ Patric R. J. Östergård; Olli Pottonen 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 74 KB 👁 1 views

## Abstract The codewords at distance three from a particular codeword of a perfect binary one‐error‐correcting code (of length 2^m^−1) form a Steiner triple system. It is a longstanding open problem whether every Steiner triple system of order 2^m^−1 occurs in a perfect code. It turns out that thi