Zobrazeno 1 - 10
of 267
pro vyhledávání: '"Iwata, Ken"'
Autor:
Hashimoto, Kengo, Iwata, Ken-ichi
A $k$-bit delay decodable code-tuple is a lossless source code that can achieve a smaller average codeword length than Huffman codes by using a finite number of code tables and allowing at most $k$-bit delay for decoding. It is known that there exist
Externí odkaz:
http://arxiv.org/abs/2409.13287
Autor:
Yamamoto, Hirosuke, Iwata, Ken-ichi
Publikováno v:
The IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Japanese Edition), July, 2022
Asymmetric Numeral Systems (ANS) proposed by Jarek Duda are high-performance distortionless data compression schemes that can achieve almost the same compression performance as arithmetic codes with less arithmetic operations than arithmetic coding.
Externí odkaz:
http://arxiv.org/abs/2408.07322
Autor:
Hashimoto, Kengo, Iwata, Ken-ichi
AIFV (almost instantaneous fixed-to-variable length) codes are noiseless source codes that can attain a shorter average codeword length than Huffman codes by allowing a time-variant encoder with two code tables and a decoding delay of at most 2 bits.
Externí odkaz:
http://arxiv.org/abs/2306.09671
Autor:
Hashimoto, Kengo, Iwata, Ken-ichi
The class of k-bit delay decodable codes, source codes allowing decoding delay of at most k bits for k >= 0, can attain a shorter average codeword length than Huffman codes. This paper discusses the general properties of the class of k-bit delay deco
Externí odkaz:
http://arxiv.org/abs/2306.07563
In-situ processing has widely been recognized as an effective approach for the visualization and analysis of large-scale simulation outputs from modern HPC systems. One of the most common approaches for batch-based in-situ visualization is the image-
Externí odkaz:
http://arxiv.org/abs/2301.11591
Autor:
Hashimoto, Kengo, Iwata, Ken-ichi
For a given independent and identically distributed (i.i.d.) source, Huffman code achieves the optimal average codeword length in the class of instantaneous code with a single code table. However, it is known that there exist time-variant encoders, w
Externí odkaz:
http://arxiv.org/abs/2209.08874
Autor:
Fukuda, Yuto, Suzuki, Takako, Iwata, Ken-ichi, Haruta, Kazunori, Yamaguchi, Makoto, Torii, Yuka, Narita, Atsushi, Muramatsu, Hideki, Takahashi, Yoshiyuki, Kawada, Jun-ichi
Publikováno v:
In Vaccine 19 April 2024 42(11):2927-2932
Autor:
Iwata, Ken-ichi, Torii, Yuka, Sakai, Aiko, Fukuda, Yuto, Haruta, Kazunori, Yamaguchi, Makoto, Suzuki, Takako, Etani, Yuri, Takahashi, Yoshiyuki, Umetsu, Shuichiro, Inui, Ayano, Sumazaki, Ryo, Kawada, Jun-ichi
Publikováno v:
In Journal of Infection and Chemotherapy July 2024
Autor:
Cornette, Richard, Indo, Hiroko P., Iwata, Ken-ichi, Hagiwara-Komoda, Yuka, Nakahara, Yuichi, Gusev, Oleg, Kikawada, Takahiro, Okuda, Takashi, Majima, Hideyuki J.
Publikováno v:
In Mitochondrion November 2023 73:84-94
Polar transforms are central operations in the study of polar codes. This paper examines polar transforms for non-stationary memoryless sources on possibly infinite source alphabets. This is the first attempt of source polarization analysis over infi
Externí odkaz:
http://arxiv.org/abs/1904.11721