✦ LIBER ✦

Class of minimax error-corecting codes based on perfect binary arrays

✍ Scribed by M. I. Mazurkov

Book ID: 111497899
Publisher: Allerton Press, Inc.
Year: 2011
Tongue: English
Weight: 194 KB
Volume: 54
Category: Article
ISSN: 0735-2727
DOI: 10.3103/s0735272711090032

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Operation algorithms and block diagrams

Operation algorithms and block diagrams of codecs of orthogonal codes based on perfect binary arrays

✍ M. I. Mazurkov; M. Yu. Gerasimenko 📂 Article 📅 2007 🏛 Allerton Press, Inc. 🌐 English ⚖ 320 KB

Family of two-dimensional correcting cod

Family of two-dimensional correcting codes on a basis of perfect binary array

✍ P. E. Baranov; M. I. Mazurkov; V. Ya. Chechelnytskyi; A. A. Yakovenko 📂 Article 📅 2009 🏛 Allerton Press, Inc. 🌐 English ⚖ 68 KB

On the nonexistence of triple-error-corr

On the nonexistence of triple-error-correcting perfect binary linear codes with a crown poset structure

✍ Hyun Kwang Kim; Dong Yeol Oh 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 177 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