Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ISIT
/
Paper
Tsallis entropy as a lower bound of average description length for the q-generalized code tree.
Hiroki Suyari
Venue
B
ISIT
Year
2007
Proceedings
ISIT
DBLP record
conf/isit/Suyari07 ↗
Browse the full
ISIT paper archive
.