Source Coding
O.1.2
Lecture
Data Compression

On a Redundancy of AIFV-m Codes for m = 3, 5

Ryusei Fujita, Ken-ichi Iwata, Hirosuke Yamamoto

Date & Time

01:00 am – 01:00 am

Source Coding └Data Compression

Abstract

Hu, Yamamoto, Honda proposed the binary AIFV-m codes and proved that the worst-case redundancy of optimal binary AIFV-m codes is exactly 1/m for m = 2,3,4. We derive a new upper bound on the redundancy of optimal binary AIFV-3 codes when the probability of the most likely source symbol is known. Furthermore, it is proved by using the redundancy bound of optimal binary AIFV-3 codes that the worst-case redundancy of optimal binary AIFV-5 codes is exactly 1/5.

Presenters

Ryusei Fujita

University of Fukui
Email

Ken-ichi Iwata

Fukui University
Email

Hirosuke Yamamoto

University of Tokyo
Email
Private Conversation

Reach out to the speaker privately
Questions & Answers

Post a publicly available question
No questions have been asked.

Session Chair

Marcelo Weinberger

Center for Science of Information
Email

Date & Time

01:00 am – 01:00 am

Session

Data Compression

A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs

On a Redundancy of AIFV-m Codes for m = 3, 5

A Universal Data Compression Scheme based on the AIVF Coding Techniques

On D-ary Fano Codes

$O(\log \log n)$ Worst-Case Local Decoding and Update Efficiency for Data Compression

Data Deduplication with Random Substitutions