A Polynomial Time Algorithm for Constructing Optimal Binary AIFV-2 Codes

Huffman Codes are optimal Instantaneous Fixed-to-Variable (FV) codes in which every source symbol can only be encoded by one codeword. Relaxing these constraints permits constructing better FV codes. More specifically, recent work has shown that AIFV- m codes can beat Huffman coding. AIFV- m codes c...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory Vol. 69; no. 10; p. 1
Main Authors: Golin, Mordecai, Harb, Elfarouk
Format: Journal Article
Language:English
Published: New York IEEE 01.10.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
AIFV Codes
AIFV-<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">m Codes
Algorithms
Binary codes
Codes
Convergence
Decoding
Delays
Ellipsoid Methods
Encoding
Huffman codes
Huffman coding
Iterative decoding
Iterative methods
Linear Programming
Polynomials
Symbols
ISSN:0018-9448, 1557-9654
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Huffman Codes are optimal Instantaneous Fixed-to-Variable (FV) codes in which every source symbol can only be encoded by one codeword. Relaxing these constraints permits constructing better FV codes. More specifically, recent work has shown that AIFV- m codes can beat Huffman coding. AIFV- m codes construct an m -tuple of different coding trees between which the code alternates and are only almost instantaneous (AI). This means that decoding a word might require a delay of a finite number of bits. Current algorithms for constructing optimal AIFV- m codes are iterative processes that construct progressively "better sets" of code trees. The processes have been proven to finitely converge to the optimal code but with no known bounds on the convergence rate. This paper derives a geometric interpretation of the space of binary AIFV-2 codes, permitting the development of the first polynomially time-bounded procedure for constructing optimal AIFV codes. This binary-search like procedure will run in O ( n 3 b ) time, where n is the number of symbols in the source alphabet and b is the maximum number of bits used to encode any one input probability.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2023.3287587