scientific article; zbMATH DE number 177895

MaRDI QIDQ4038778zbMATH OpenFDO

Authors Patrick Solé

Publication date 18 May 1993

zbMATH Keywords

boundsChinese Postman problemcocycle codes of graphscographic matroidscovering radiuscycle code of matroidscycle codes of graphsGale-Berlekamp switching gamegraphic matroids

Mathematics Subject Classification ID

Cyclic codes (94B15) Combinatorial codes (94B25)

Recommendations

• The covering radius of the cycle code of a graph
• A new approach to the covering radius of codes
• scientific article; zbMATH DE number 1024657
• On the combinatorial structure of a class of \(\left[ \binom m 2, \binom{m-1}{2}, 3\right]\) shortened Hamming codes and their dual-codes
• Covering radii are not matroid invariants

Cited in

(11)

• Fault-detection in networks
• De Bruijn covering codes with arbitrary alphabets
• A lattice-based McEliece scheme for encryption and signature
• Sum-free sets and short covering codes
• Optimal binary covering codes of length 2j
• scientific article; zbMATH DE number 645821 (Why is no real title available?)
• Long packing and covering codes
• Covering properties of convolutional codes and associated lattices
• Almost cover-free codes and designs
• The application of coding theory to the design of combinatorial filing schemes of any order
• Bounds for short covering codes and reactive tabu search

This page was built for publication:

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