DocumentCode :
3294965
Title :
Körner-Marton theorem for binary modulo-two sum problem from canonical equations
Author :
Blahut, Richard E. ; Jana, Soumya
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Illinois, Urbana, IL, USA
fYear :
2010
fDate :
17-20 Oct. 2010
Firstpage :
406
Lastpage :
409
Abstract :
The Körner-Marton modulo two-sum problem is described as a variation of the lossless two-help-one source coding problem.
Keywords :
binary codes; source coding; Körner-Marton theorem; binary modulo-two sum problem; canonical equations; lossless two-help-one source coding problem; Channel coding; Decoding; Equations; Joints; Redundancy; Source coding;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory and its Applications (ISITA), 2010 International Symposium on
Conference_Location :
Taichung
Print_ISBN :
978-1-4244-6016-8
Electronic_ISBN :
978-1-4244-6017-5
Type :
conf
DOI :
10.1109/ISITA.2010.5649269
Filename :
5649269
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=3294965
بازگشت