A Universal Data Compression Scheme based on the AIVF Coding Techniques

Properties of <i>k</i>-Bit Delay Decodable Codes

“…. , π |F |−1 ) ∈ R |F | of the following simultaneous equations (19) and ( 20) is called a stationary distribution of F:…”

Optimality of Huffman Code in the Class of 1-Bit Delay Decodable Codes

“…Thus, the dimension of the null space of A is greater than or equal to 1. In particular, Equation (142), which is equivalent to (19), has a non-trivial solution π π π = 0 0 0. We choose such π π π = (π 0 , π 1 , .…”

“…where (A) follows since π π π ′ satisfies (19), and (B) follows from (146) and i ′ ∈ A i . Also, we have…”

“…(R F ⊆ I + ) By(20), the set I + is not empty. Also, by(19) and Lemma 21 stated in Appendix C.2, the set I + is closed. Hence, we obtain R F ⊆ I + by Lemma 22 (ii).…”

“…The worst-case redundancy of AIFV-m codes is analyzed in [7,8] for m = 2, 3, 4, 5. The literature [9][10][11][12][13][14][15][16][17][18][19][20][21][22] propose the code construction and coding method of AIFV and AIFV-m codes. Extensions of AIFV-m codes are proposed in [23,24].…”