DocumentCode :
3592732
Title :
Universal codes on continuous alphabet using sparse matrices
Author :
Miyake, S. ; Muramatsu, Junya
Author_Institution :
Network Innovation Labs., NTT, Yokosuka, Japan
fYear :
2012
Firstpage :
493
Lastpage :
497
Abstract :
Sparse matrix codes for the channel coding problem and the lossy source coding problem on a continuous alphabet are constructed. The constructed codes are universal codes that do not depend on the statistical property of the communication systems. Coding theorems are shown for each problem.
Keywords :
source coding; sparse matrices; statistical analysis; channel coding problem; communication system; continuous alphabet; lossy source coding problem; sparse matrix code; statistical property; universal code; Channel coding; Communication systems; Decoding; Quantization; Source coding; Sparse matrices;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory and its Applications (ISITA), 2012 International Symposium on
Print_ISBN :
978-1-4673-2521-9
Type :
conf
Filename :
6400984
Link To Document :
بازگشت