Matroid certificates from coordinate ranks bound zero-error confusability capacity; realizable relations are upward-closed agreement families, with host realizability equivalent to zero-delay synchronization plus side information.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Zero-Error Recovery under Deterministic Partial Views: Matroid Bounds and Verifiable Realizability
Matroid certificates from coordinate ranks bound zero-error confusability capacity; realizable relations are upward-closed agreement families, with host realizability equivalent to zero-delay synchronization plus side information.