✦ LIBER ✦

Reliability, covering and balanced matrices

✍ Scribed by Michael O. Ball; Feng L. Lin

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 489 KB
Volume: 17
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(94)00047-a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sign-balanced covering matrices

✍ Anant P. Godbole; Laura K. Potter; Erik J. Sandquist 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 717 KB

A qxn array with entries from {0, 1 ..... q-l} is said to form a difference matrix if the vector difference (modulo q) of each pair of columns consists of a permutation of {0, 1 ..... q -1 }; this definition is inverted from the more standard one to be found, e.g., in Colbourn and de Launey (1996).

Reliability covering problems

✍ M. O. Ball; J. S. Provan; D. R. Shier 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 725 KB

Perfect Codes and Balanced Generalized W

Perfect Codes and Balanced Generalized Weighing Matrices

✍ Dieter Jungnickel; Vladimir D. Tonchev 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 110 KB

It is proved that any set of representatives of the distinct one-dimensional subspaces in the dual code of the unique linear perfect single-error-correcting code of length (qB!1)/(q!1) over GF(q) is a balanced generalized weighing matrix over the multiplicative group of GF(q). Moreover, this matrix

Balanced partitioned matrices and their

Balanced partitioned matrices and their Kronecker products

✍ Derrick S. Tracy 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 429 KB

Matchings, covers, and Jacobian matrices

✍ Manfred Gilli; Myriam Garbely 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 948 KB

Perfect Codes and Balanced Generalized W

Perfect Codes and Balanced Generalized Weighing Matrices, II

✍ Dieter Jungnickel; Vladimir D. Tonchev 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 116 KB

In a previous paper, the authors proved that any set of representatives of the distinct 1dimensional subspaces in the dual code of the unique linear perfect single-error-correcting code of length (qB!1)/(q!1) over GF(q) is a balanced generalized weighing matrix over the multiplicative group of GF(q)