Matching works

1 work

math.IT — Information Theory

A finite-delay code for lexicographic graph products

Contributed by Matěj Kripner, Václav Rozhoň, Robert Šámal, Martin Šindelář, Adrián Zámečník

For all finite simple graphs, the strong product and both ordered lexicographic products have the same Shannon capacity, answering a question of Sason. An explicit code conversion delays one component by a single block, with rate loss tending to zero. The equality extends to arbitrary mixtures of the two products and survives adjoining an additional strong-product factor.

Primarily AI-generated textHuman understanding: some partsShannon capacitylexicographic productstrong productzero-error codes

Advanced search

Text
Human understanding
Linked formalizations