Search
Abstract
We present two greedy algorithms that determine zero-error codes and lower bounds on the zero-error capacity. These algorithms have many advantages, e.g., they do not store a whole product graph in a computer memory and they use the so-called distributions in all dimensions to get better approximations of the zero-error capacity. We also show an additional application of our algorithms.
Citations
-
0
CrossRef
-
0
Web of Science
-
0
Scopus
Cite as
Full text
download paper
downloaded 43 times
- Publication version
- Accepted or Published Version
- DOI:
- Digital Object Identifier (open in new tab) 10.1007/s10878-021-00825-y
- License
-
open in new tab
Keywords
Details
- Category:
- Articles
- Type:
- artykuły w czasopismach
- Published in:
-
JOURNAL OF COMBINATORIAL OPTIMIZATION
no. 44,
pages 2963 - 2980,
ISSN: 1382-6905 - Language:
- English
- Publication year:
- 2022
- Bibliographic description:
- Jurkiewicz M.: On zero-error codes produced by greedy algorithms// JOURNAL OF COMBINATORIAL OPTIMIZATION -Vol. 44,iss. 5 (2022), s.2963-2980
- DOI:
- Digital Object Identifier (open in new tab) 10.1007/s10878-021-00825-y
- Sources of funding:
-
- Free publication
- Verified by:
- Gdańsk University of Technology
seen 167 times