An algebraic construction of codes for Slepian-Wolf source networks

IEEE Transactions on Information Theory

Volumn 47, Issue 7, 2001, Pages 3082-3088

  Uyematsu, Tomohiko ^a,b  

^a IEEE   (Japan)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Ergodic process; Fixed length code; Slepian Wolf (SW) coding; Source coding

Indexed keywords

ERGODIC PROCESSES;

CODES (SYMBOLS); COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; DECODING; ERROR ANALYSIS; POLYNOMIALS; PROBABILITY;

SIGNAL ENCODING;

EID: 0035504392     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.959290     Document Type: Article

References (13)

1. Noiseless coding of correlated information sources
2. A proof of the data compression theorems of Slepian and Wolf for ergodic sources
3. Source coding with side information and a converse for degraded broadcast channels
4. Common randomness in information theory and cryptography-Part I: Secret sharing
5. Algebraic constructions of Shannon codes for regular channels
6. A class of constructive asymptotically good algebraic codes
7. Linear codes for sources and source networks: Error exponents, universal coding
8. Codes on algebraic curves
9. A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate
10. A code decomposition approach for decoding cyclic and algebraic-geometric codes