The covering radius of Hadamard codes in odd graphs
type: Item
instance of: scholarly article
title: The covering radius of Hadamard codes in odd graphs
zbMATH Open document ID: 0755.94012
DOI: 10.1016/0166-218X(92)90154-3
author: Patrick Solé
author: Arif Ghafoor
author: Sohail A. Sheikh
published in: Discrete Applied Mathematics
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 94C30
zbMATH DE Number: 94329
zbMATH Keywords: Hadamard designs
zbMATH Keywords: Hadamard matrices
zbMATH Keywords: coset weight distribution
zbMATH Keywords: odd graphs
zbMATH Keywords: fault-tolerant interconnection networks
zbMATH Keywords: covering radius
zbMATH Keywords: Hadamard code
zbMATH Keywords: first order Reed-Muller code
MaRDI profile type: Publication
cites work: A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table
cites work: Fault Diagnosis in a Boolean n Cube Array of Microprocessors
cites work: Q3218140
cites work: Weight distributions of the cosets of the (32,6) Reed-Muller code
cites work: Q3039368
cites work: Large fault-tolerant interconnection networks
cites work: Q3686719
cites work: Q3936766
cites work: Covering radius---Survey and recent results
cites work: Four fundamental parameters of a code and their combinatorial significance
cites work: Perfect codes in the graphs \(O_k\)
cites work: On the covering radius of binary codes (Corresp.)
cites work: Q4146667
cites work: Combinatorics. Room squares, sum-free sets, Hadamard matrices
cites work: Connectivity of transitive graphs
full work available at URL: 0166-218x(92)90154-3
OpenAlex ID: W2131641228
description: scientific article; zbMATH DE number 94329