The covering radius of doubled 2-designs in \(2O_ k\)

DOI10.1016/0166-218X(91)90117-FzbMath0831.05017MaRDI QIDQ5905437

Patrick Solé, Arif Ghafoor

Publication date: 27 June 1992

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

zbMATH Keywords

coveringcovering radiuscovering codesdoubled odd graph

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Other designs, configurations (05B30) Combinatorial codes (94B25) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (1)

Expanding and forwarding

Cites Work

• Large fault-tolerant interconnection networks
• Covering radius---Survey and recent results
• Fault Diagnosis in a Boolean n Cube Array of Microprocessors
• DESIGNS, FACTORS AND CODES IN GRAPHS
• On the covering radius of binary codes (Corresp.)
• A study of odd graphs as fault-tolerant interconnection networks
• A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table
• Connectivity of transitive graphs
• On Some Tactical Configurations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The covering radius of doubled 2-designs in \(2O_ k\)