On greedy algorithms in coding theory

DOI10.1109/18.556707zbMath0867.94029OpenAlexW2051783668MaRDI QIDQ3129491

Gilles Zémor, Gérard D. Cohen, Simon N. 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 algorithmhypergraphscovering codesincidence matricesderandomizationdisjunctive arrayssurjective arrays

Mathematics Subject Classification ID

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

Related Items (6)

Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search ⋮ Strengthening hash families and compressive sensing ⋮ Locating and detecting arrays for interaction faults ⋮ An extension of Stein-Lovász theorem and some of its applications ⋮ 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

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