REVIEW
Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
classification
cs.ITmath.IT
keywords
networkalphabetcapacityconsiderdiamondfixedsizesbounds
read the original abstract
We consider the problem of error correction in a network where the errors can occur only on a proper subset of the network edges. For a generalization of the so-called Diamond Network we consider lower and upper bounds for the network's (1-shot) capacity for fixed alphabet sizes.
Discussion (0). Continue with ORCID to comment.