𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decomposition of Binary Matrices and Fast Hadamard Transforms

✍ Scribed by Hakob Sarukhanyan; Sos Agaian; Jaakko Astola; Karen Egiazarian

Publisher
Springer
Year
2005
Tongue
English
Weight
105 KB
Volume
24
Category
Article
ISSN
0278-081X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Decomposition of Hadamard matrices
Decomposition of Hadamard matrices
✍ Morris Plotkin πŸ“‚ Article πŸ“… 1972 πŸ› Elsevier Science 🌐 English βš– 146 KB
Decompositions of Complete Multigraphs R
Decompositions of Complete Multigraphs Related to Hadamard Matrices
✍ David A Gregory; Kevin N Vander Meulen πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 242 KB

Let bp(+K v ) be the minimum number of complete bipartite subgraphs needed to partition the edge set of +K v , the complete multigraph with + edges between each pair of its v vertices. Many papers have examined bp(+K v ) for v 2+. For each + and v with v 2+, it is shown here that if certain Hadamard

Some Hadamard matrices of order 32 and t
Some Hadamard matrices of order 32 and their binary codes
✍ 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