DocumentCode
3059531
Title
Hamming coding for Multiple Sources
Author
Ma, Rick ; Cheng, Samuel
Author_Institution
Dept. of Math., Hong Kong Univ. of Sci. & Technol., Hong Kong, China
fYear
2010
fDate
13-18 June 2010
Firstpage
171
Lastpage
175
Abstract
We introduce Hamming Codes for Multiple Sources (HCMSs) as a potential solution of perfect Slepian-Wolf (SW) coding for arbitrary number of terminals. Moreover, we study the case with three sources in detail. We present the necessary conditions of a perfect SW code and show that there exists infinite number of HCMSs. Moreover, we show that for perfect SW code with sufficiently long code length, the compression rates of different sources can be trade-off flexibly.
Keywords
Hamming codes; data compression; Hamming codes for multiple sources; compression rates; perfect Slepian-Wolf coding; Base stations; Channel coding; Decoding; Encoding; Entropy; Hydrogen; Mathematics; Source coding; Hamming code; Slepian-Wolf coding; distributed source coding; perfect code;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
Conference_Location
Austin, TX
Print_ISBN
978-1-4244-7890-3
Electronic_ISBN
978-1-4244-7891-0
Type
conf
DOI
10.1109/ISIT.2010.5513256
Filename
5513256
Link To Document