Treffer: Hamming coding for Multiple Sources
Title:
Hamming coding for Multiple Sources
Authors:
Publication Year:
2010
Collection:
The Hong Kong University of Science and Technology: HKUST Institutional Repository
Subject Terms:
Document Type:
Konferenz
conference object
Language:
English
Relation:
DOI:
10.1109/ISIT.2010.5513256
Availability:
http://repository.hkust.edu.hk/ir/Record/1783.1-33040
https://doi.org/10.1109/ISIT.2010.5513256
http://lbdiscover.ust.hk/uresolver?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rfr_id=info:sid/HKUST:SPI&rft.genre=article&rft.issn=&rft.volume=&rft.issue=&rft.date=2010&rft.spage=171&rft.aulast=Ma&rft.aufirst=R.&rft.atitle=Hamming+coding+for+Multiple+Sources&rft.title=IEEE+International+Symposium+on+Information+Theory+-+Proceedings
http://www.scopus.com/record/display.url?eid=2-s2.0-77955687303&origin=inward
http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=LinksAMR&SrcApp=PARTNER_APP&DestLinkType=FullRecord&DestApp=WOS&KeyUT=000287512700035
https://doi.org/10.1109/ISIT.2010.5513256
http://lbdiscover.ust.hk/uresolver?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rfr_id=info:sid/HKUST:SPI&rft.genre=article&rft.issn=&rft.volume=&rft.issue=&rft.date=2010&rft.spage=171&rft.aulast=Ma&rft.aufirst=R.&rft.atitle=Hamming+coding+for+Multiple+Sources&rft.title=IEEE+International+Symposium+on+Information+Theory+-+Proceedings
http://www.scopus.com/record/display.url?eid=2-s2.0-77955687303&origin=inward
http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=LinksAMR&SrcApp=PARTNER_APP&DestLinkType=FullRecord&DestApp=WOS&KeyUT=000287512700035
Accession Number:
edsbas.76CCE540
Database:
BASE
Weitere Informationen
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. © 2010 IEEE.