Takuya Koyama

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We consider a problem to build good prefix-free code for the transmission of a stationary memoryless source across a finite-state noiseless channel with unequal symbol costs. Our scheme is an improvement of Golin and Rote's algorithm for constructing good prefix-free codes to the state dependent noiseless channel case by removing an assumption that channel(More)
  • 1