On greedy algorithms in coding theory

DOI10.1109/18.556707MaRDI QIDQ3129491zbMATH OpenOpenAlexFDO

Authors Gilles Zémor, Gérard Cohen, Simon Litsyn

Publication date 27 April 1997

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/aa699a71917490773075fca40db8289dbf38db49

zbMATH Keywords

greedy algorithmderandomizationhypergraphscovering codesincidence matricesdisjunctive arrayssurjective arrays

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Hypergraphs (05C65) Linear codes (general theory) (94B05) Combinatorial aspects of packing and covering (05B40) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• Greedy codes
• A note on greedy codes
• Greedy and heuristic algorithms for codes and colorings

Cited in

(10)

• Locating and detecting arrays for interaction faults
• Greedy codes
• scientific article; zbMATH DE number 841643 (Why is no real title available?)
• Merging covering arrays and compressing multiple sequence alignments
• New types of estimates for the smallest size of complete arcs in a finite Desarguesian projective plane
• Forcing linearity on greedy codes
• Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search
• An extension of Stein-Lovász theorem and some of its applications
• On zero-error codes produced by greedy algorithms
• Strengthening hash families and compressive sensing

This page was built for publication: On greedy algorithms in coding theory

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