DocumentCode
2002348
Title
Coding combinatorial sources with costs
Author
Suzuki, Joe ; Ryabko, Boris
Author_Institution
Dept. of Math., Osaka Univ., Japan
fYear
2003
fDate
29 June-4 July 2003
Firstpage
113
Abstract
In this paper we define a combinatorial source by constructing an encoding method with costs and proving its optimality via Kraft´s inequality.
Keywords
combinatorial mathematics; encoding; Kraft´s inequality; code construction cost; code optimality; combinatorial source; encoding method; Cost function; Decoding; Encoding; Mathematics; Telecommunications;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2003. Proceedings. IEEE International Symposium on
Print_ISBN
0-7803-7728-1
Type
conf
DOI
10.1109/ISIT.2003.1228127
Filename
1228127
Link To Document