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
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
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)
## 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
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
## 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$