An Approximation of the Zero Error Capacity by a Greedy Algorithm.

Marcin Jurkiewicz

doi:10.1007/978-3-030-64843-5_7

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

Author (1)

Marcin Jurkiewicz dr

Cite as

Full text

full text is not available in portal

full content of the article see on external site open in new tab

Keywords

GREEDY ALGORITHM, INDEPENDENCE NUMBER, SHANNON CAPACITY, STRONG PRODUCT

Details

Category:: Conference activity
Type:: publikacja w wydawnictwie zbiorowym recenzowanym (także w materiałach konferencyjnych)
Language:: English
Publication year:: 2020
Bibliographic description:: Jurkiewicz M.: An Approximation of the Zero Error Capacity by a Greedy Algorithm.// / : , 2020,
DOI:: Digital Object Identifier (open in new tab) 10.1007/978-3-030-64843-5_7
Verified by:: Gdańsk University of Technology