- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- 【Updated on June 30, 2025】Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
A Consideration of Partial Decodability of Compact Codes
-
- HASEGAWA Madoka
- Graduate School of Engineering, Utsunomiya University
-
- KATO Shigeo
- Faculty of Engineering, Utsunomiya University
-
- YAMADA Yoshifumi
- Faculty of Engineering, Utsunomiya University
Bibliographic Information
- Other Title
-
- ハフマン符号の部分復号可能性について
Search this article
Description
In this paper, we propose a partial decodable efficient code. A specified code word of some code set can be detectable without sequential decoding. For example, a code word of all 1 pattern is detectable in any code sequences unless the word successively appears. Because any code word except a code word of all 1 pattern contains bit 0 in it, the length of 1 run caused by concatenations of any code word is limited to finite length. We reveal a partial decodability of compact codes using such characteristics.
Journal
-
- IEICE technical report. Image engineering
-
IEICE technical report. Image engineering 98 (4), 77-84, 1998-04-17
The Institute of Electronics, Information and Communication Engineers
- Tweet
Details 詳細情報について
-
- CRID
- 1572261552264319744
-
- NII Article ID
- 110003202279
-
- NII Book ID
- AN10013006
-
- Text Lang
- ja
-
- Data Source
-
- CiNii Articles