An approximation of the zero error capacity by a greedy algorithm

DOI10.1007/978-3-030-64843-5_7MaRDI QIDQ2692204zbMATH OpenOpenAlexFDO

Authors Marcin Jurkiewicz

Publication date 21 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-64843-5_7

zbMATH Keywords

greedy algorithmindependence numberShannon capacitystrong product

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Cited in

(2)

• On zero-error codes produced by greedy algorithms
• Error Analysis and Convergence of Capacity Dimension Algorithms

This page was built for publication: An approximation of the zero error capacity by a greedy algorithm

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