Old Web
English
Sign In
Acemap
>
Paper
>
Constructing prefix-free codes for finite-state noiseless channels
Constructing prefix-free codes for finite-state noiseless channels
2009
Koyama Takuya
Iwata Ken-ichi
Keywords:
Block code
Longest path problem
Shortest path problem
Prefix code
Theoretical computer science
Communication channel
Distributed computing
Prefix
Computer science
Algorithm
finite state
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]