Combinatorial version of the Slepian-Wolf coding theorem for binary strings

DOI10.17377/SEMI.2013.10.053MaRDI QIDQ891041zbMATHFDO

Authors D. A. Chumbalov

Publication date 16 November 2015

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

zbMATH Keywords

communication complexitydistributed source codingSlepian-Wolf theorem

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Randomized polynomial time protocol for combinatorial Slepian-Wolf problem
• On Slepian-Wolf theorem with interaction
• On Slepian-Wolf theorem with interaction
• One-sided error communication complexity of gap Hamming distance
• Kolmogorov complexity version of Slepian-Wolf coding

Cited in

(5)

• On the Varshamov-Tenengolts construction on binary strings
• Randomized polynomial time protocol for combinatorial Slepian-Wolf problem
• Coding Strings by Pairs of Strings
• Combinatorics of canonical bases revisited: string data in type \textsf{A}
• Constrained Embedding Probability for Two Binary Strings

This page was built for publication: Combinatorial version of the Slepian-Wolf coding theorem for binary strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q891041)