The covering radius of the cycle code of a graph

DOI10.1016/0166-218X(93)90140-JzbMATH Open0778.94008WikidataQ126351285 ScholiaQ126351285MaRDI QIDQ686525FDOQ686525

Authors: Patrick Solé, Thomas Zaslavsky 

Publication date: 2 December 1993

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

Recommendations

• On the Covering Radius of Certain Cyclic Codes
• The covering radius of Hadamard codes in odd graphs
• Covering Radius Computations for Binary Cyclic Codes
• On the covering radius of some binary cyclic codes
• scientific article; zbMATH DE number 721640
• scientific article; zbMATH DE number 4095515
• Graphs associated with codes of covering radius 1 and minimum distance 2
• Maximality of the cycle code of a graph
• scientific article; zbMATH DE number 4061294
• The covering radius of cyclic codes of length up to 31 (Corresp.)

zbMATH Keywords

covering radiuscharacteristic vectors of circuitcycle code

Mathematics Subject Classification ID

Cyclic codes (94B15) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Graph theory
• Matching theory
• Title not available (Why is that?)
• On the complexity of some coding problems (Corresp.)
• On the covering radius of cyclic linear codes and arithmetic codes
• Über den Zusammenhang symmetrischer Graphen
• Connectivity of transitive graphs
• Graph theoretic error-correcting codes
• Conservative weightings and ear-decompositions of graphs
• On the covering radius of codes
• Maximality of the cycle code of a graph
• Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (11)

• Maximality of the cycle code of a graph
• Decreasing behavior of the depth functions of edge ideals
• Associated primes of powers of edge ideals and ear decompositions of graphs
• Disjoint Hamiltonian cycles in minimum distance graphs of 1-perfect codes
• Lit-only sigma game on a line graph
• Eulerian ideals
• A general formula for the index of depth stability of edge ideals
• Complexity of circuit intersection in graphs
• Fault-detection in networks
• Title not available (Why is that?)
• Joins, ears and Castelnuovo-Mumford regularity

This page was built for publication: The covering radius of the cycle code of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686525)