An algebraic construction of codes for Slepian-Wolf source networks

DOI10.1109/18.959290zbMATH Open1021.94011OpenAlexW2163994351MaRDI QIDQ4544757FDOQ4544757

Authors: Tomohiko Uyematsu 

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.959290

Recommendations

• On code design for the Slepian-Wolf problem and lossless multiterminal networks
• Towards a general theory of source networks
• Approaching the Slepian-Wolf boundary using practical channel codes
• A general and optimal framework to achieve the entire rate region for Slepian-Wolf coding
• Zero-error codes for correlated information sources

zbMATH Keywords

ergodic processsource codingSlepian-Wolf codingalgebraic geometry codesource networksfixed-length code

Mathematics Subject Classification ID

Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Error probability in coding theory (94B70)

Cited In (7)

• Linear codes for sources and source networks: Error exponents, universal coding
• Towards a general theory of source networks
• A general and optimal framework to achieve the entire rate region for Slepian-Wolf coding
• On code design for the Slepian-Wolf problem and lossless multiterminal networks
• Weak Variable-Length Slepian–Wolf Coding With Linked Encoders for Mixed Sources
• Approaching the Slepian-Wolf boundary using practical channel codes
• Title not available (Why is that?)

This page was built for publication: An algebraic construction of codes for Slepian-Wolf source networks

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