𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Ordered partitions and codes generated by circulant matrices

✍ Scribed by R Razen; Jennifer Seberry; K Wehrhahn


Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
368 KB
Volume
27
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Perfect Codes and Balanced Generalized W
✍ 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

Perfect Codes and Balanced Generalized W
✍ 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)

Some Hadamard matrices of order 32 and t
✍ Makoto Araya; Masaaki Harada; Hadi Kharaghani πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 70 KB πŸ‘ 1 views

## Abstract It is known that all doubly‐even self‐dual codes of lengths 8 or 16, and the extended Golay code, can be constructed from some binary Hadamard matrix of orders 8, 16, and 24, respectively. In this note, we demonstrate that every extremal doubly‐even self‐dual [32,16,8] code can be const

Performance analysis and optimization on
✍ Lou, John Z.; Farrara, John D. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 163 KB πŸ‘ 1 views

An analysis is presented of the primary factors influencing the performance of a parallel implementation of the UCLA atmospheric general circulation model (AGCM) on distributedmemory, massively parallel computer systems. Several modifications to the original parallel AGCM code aimed at improving its

Enumeration of generalized Hadamard matr
✍ P. B. Gibbons; R. Mathon πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 142 KB

## Abstract We investigate signings of symmetric GDD($16 \times 2^i$, 16, $2^{4-i}$)s over $Z\_2$ for $1 \le i \le 3$. Beginning with $i=1$, at each stage of this process a signing of a GDD($16 \times 2^i$, 16, $2^{4-i}$) produces a GDD($16 \times 2^{i+1}$, 16, $2^{4-i-1}$). The initial GDDs ($i=1$