The covering radius of Hadamard codes in odd graphs

DOI10.1016/0166-218X(92)90154-3zbMath0755.94012OpenAlexW2131641228MaRDI QIDQ1199453

Sohail A. Sheikh, Patrick Solé, Arif Ghafoor

Publication date: 16 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90154-3

zbMATH Keywords

covering radiusHadamard matricesHadamard designsodd graphsHadamard codecoset weight distributionfault-tolerant interconnection networksfirst order Reed-Muller code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications of design theory to circuits and networks (94C30)

Related Items (1)

Connectivity, persistence and fault diagnosis of interconnection networks based on \(O_ k\) and \(2O_ k\) graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large fault-tolerant interconnection networks
• Perfect codes in the graphs \(O_k\)
• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• Covering radius---Survey and recent results
• Fault Diagnosis in a Boolean n Cube Array of Microprocessors
• On the covering radius of binary codes (Corresp.)
• Four fundamental parameters of a code and their combinatorial significance
• A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table
• Connectivity of transitive graphs
• Weight distributions of the cosets of the (32,6) Reed-Muller code

This page was built for publication: The covering radius of Hadamard codes in odd graphs