The minimum codeword length and redundancy in the binary Huffman code for uncertain sources.
Kailash BirmiwalPublished in: IEEE Trans. Inf. Theory (1990)
Keyphrases
- hamming distance
- binary codes
- error correcting
- vector quantization
- information sources
- logical operations
- minimum length
- decision making
- image processing
- non binary
- gray code
- source code
- bit string
- incomplete information
- error correcting codes
- knowledge sources
- multiple description coding
- distance measure
- total length