𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on self-orthogonal codes

✍ Scribed by Alexander Pott

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
124 KB
Volume
76
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the classification of weighing matric
On the classification of weighing matrices and self-orthogonal codes
✍ Masaaki Harada; Akihiro Munemasa πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 265 KB

## Abstract We provide a classification method of weighing matrices based on a classification of self‐orthogonal codes. Using this method, we classify weighing matrices of orders up to 15 and order 17, by revising some known classification. In addition, we give a revised classification of weighing

A Note on Greedy Codes
A Note on Greedy Codes
✍ D. Fon-Der-Flaass πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 214 KB

In their paper (J. Combin. Theory Ser. A 64 (1993), 10 30) Brualdi and Pless prove linearity of some binary codes obtained by a greedy algorithm and establish lower bounds for the dimension of these codes. In this note, we show that actually they have proved a much more general result, and show that

Orthogonal designs, self-dual codes, and
Orthogonal designs, self-dual codes, and the Leech lattice
✍ Masaaki Harada; Hadi Kharaghani πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 212 KB

## Abstract Symmetric designs and Hadamard matrices are used to construct binary and ternary self‐dual codes. Orthogonal designs are shown to be useful in construction of self‐dual codes over large fields. In this paper, we first introduce a new array of order 12, which is suitable for any set of f

On a personal note governance codes
On a personal note governance codes
✍ John Carver; Miriam Carver πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons βš– 249 KB πŸ‘ 2 views