On the dual distance and the gap of a binary code

DOI10.1016/S0012-365X(98)00080-6zbMath0949.94006OpenAlexW1998195989MaRDI QIDQ1584453

Patrick Solé, Jean-Pierre Tillich

Publication date: 2 November 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00080-6

zbMATH Keywords

lower boundsymmetric graphsaverage distanceaverage distortiongap symmetric codes

Mathematics Subject Classification ID

Applications of graph theory (05C90) Cyclic codes (94B15)

Cites Work

• Diameter, covering index, covering radius and eigenvalues
• The edge-forwarding index or orbital regular graphs
• Expanding and forwarding
• On Canonical Concurrent Flows, Crossing Number and Graph Expansion
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the dual distance and the gap of a binary code