Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Minimum Delay Huffman Code in Backward Decoding Procedure   For some applications where the speed of decoding and the fault tolerance are
important, like in video storing, one of the successful answers is Fix-Free
Codes. These codes have been applied in some standards like H.263+ and MPEG-4.
The cost of using fix-free codes is to increase the redundancy of the code
which means the increase in the amount of bits we need to represent any peace
of information. Thus we investigated the use of Huffman Codes with low and
negligible backward decoding delay. We showed that for almost all cases there
is always a Minimum Delay Huffman Code for a given length vector. The average
delay of this code for anti-uniform sources is calculated, that is in agreement
with the simulations, and it is shown that this delay is one bit for large
alphabet sources. Also an algorithm is proposed which will find the minimum
delay code with a good performance.

30
The categories of this paper are: q-alg
17
The categories of this paper are: q-fin
19
The categories of this paper are: eess
26
The categories of this paper are: bayes-an
25
The categories of this paper are: patt-sol
23
The categories of this paper are: solv-int
20
The categories of this paper are: acc-phys
6
The categories of this paper are: astro-ph
24
The categories of this paper are: dg-ga
8
The categories of this paper are: hep-ex
27
The categories of this paper are: comp-gas
10
The categories of this paper are: q-bio
32
The categories of this paper are: atom-ph
15
The categories of this paper are: nucl-ex
33
The categories of this paper are: plasm-ph
11
The categories of this paper are: hep-lat