PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Honda, Junya"

Author of the publication

copydeleteadd this publication to your clipboard
Worst-case Redundancy of Optimal Binary AIFV Codes and their Extended Codes.

, , and . CoRR, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Honda, Junya
add a person with the name Honda, Junya
 

Other publications of authors with the same name

Tight upper bounds on the redundancy of optimal binary AIFV codes., , and . ISIT, page 6-10. IEEE, (2016)Variable Length Lossy Coding Using an LDPC Code., and . IEEE Trans. Information Theory, 60 (1): 762-775 (2014)Almost Instantaneous Fixed-to-Variable Length Codes., , and . IEEE Trans. Information Theory, 61 (12): 6432-6443 (2015)Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm., , and . ICML, volume 48 of JMLR Workshop and Conference Proceedings, page 1235-1244. JMLR.org, (2016)Fast Linear-Programming decoding of LDPC codes over GF(2m)., and . ISITA, page 754-758. IEEE, (2012)Variable-to-Fixed Length Homophonic Coding with a Modified Shannon-Fano-Elias Code., and . CoRR, (2016)Unsupervised Domain Adaptation Based on Source-guided Discrepancy., , , , , and . CoRR, (2018)Polar coding without alphabet extension for asymmetric channels., and . ISIT, page 2147-2151. IEEE, (2012)Dueling Bandits with Qualitative Feedback., , and . AAAI, page 5549-5556. AAAI Press, (2019)Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem., , , and . COLT, volume 40 of JMLR Workshop and Conference Proceedings, page 1141-1154. JMLR.org, (2015)