MO1.R4.4

A (Weakly) Polynomial Algorithm for AIVF Coding

Reza Hosseini Dolatabadi, Sharif University of Technology, Iran; Mordecai Golin, UMass Amherst, United States; Arian Zamani, Sharif University of Technology, Iran
Session:
Lossless Source Coding
Track:
10: Source Coding and Data Compression
Location:
Omikron II
Presentation Time:
Mon, 8 Jul, 11:05 - 11:25
Session Chair:
Tamas Linder, Queen's University
Presentation
Not logged in.
Discussion
Not logged in.
Session MO1.R4
MO1.R4.1: AIFV Codes Allowing 2-bit Decoding Delays for Unequal Bit Cost
Ken-ichi Iwata, Kengo Hashimoto, Takahiro Wakayama, University of Fukui, Japan; Hirosuke Yamamoto, The University of Tokyo, Japan
MO1.R4.2: An Asymmetric Encoding-Decoding Scheme for Lossless Data Compression
Hirosuke Yamamoto, The University of Tokyo, Japan; Ken-ichi Iwata, University of Fukui, Japan
MO1.R4.3: Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes
Mordecai Golin, UMass Amherst, United States; Reza Hosseini Dolatabadi, Arian Zamani, Sharif University of Technology, Iran
MO1.R4.4: A (Weakly) Polynomial Algorithm for AIVF Coding
Reza Hosseini Dolatabadi, Sharif University of Technology, Iran; Mordecai Golin, UMass Amherst, United States; Arian Zamani, Sharif University of Technology, Iran
Resources
No resources available.