An Approximation of the Zero Error Capacity by a Greedy Algorithm - Publication - Bridge of Knowledge

Search

An Approximation of the Zero Error Capacity by a Greedy Algorithm

Abstract

We present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.

Citations

  • 1

    CrossRef

  • 0

    Web of Science

  • 1

    Scopus

Cite as

Full text

full text is not available in portal

Keywords

Details

Category:
Monographic publication
Type:
rozdział, artykuł w książce - dziele zbiorowym /podręczniku w języku o zasięgu międzynarodowym
Language:
English
Publication year:
2020
Bibliographic description:
Jurkiewicz M.: An Approximation of the Zero Error Capacity by a Greedy Algorithm// Combinatorial Optimization and Applications/ : , 2020, s.91-104
DOI:
Digital Object Identifier (open in new tab) 10.1007/978-3-030-64843-5_7
Verified by:
Gdańsk University of Technology

seen 96 times

Recommended for you

Meta Tags