# Huffman coding

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- IEEE Transactions on Wireless Communications
- 2017

Antenna switch enables multiple antennas to share a common RF chain. It also offers an additional spatial dimension, i.eâ€¦Â (More)

Is this relevant?

Highly Cited

2016

Highly Cited

2016

- ICLR
- 2016

Neural networks are both computationally intensive and memory intensive, making them difficult to deploy on embedded systems withâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- IEEE Transactions on Computers
- 2007

Selective Huffman coding has recently been proposed for efficient test- data compression with low hardware overhead. In thisâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Pattern Recognition
- 2005

This paper presents a new chain code based on the eight-direction Freeman code. Each element in the chain is coded as a relativeâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Comput. J.
- 2003

A simple parallel algorithm for decoding a Huffman encoded file is presented, exploiting the tendency of Huffman codes toâ€¦Â (More)

Is this relevant?

1993

1993

- Computing
- 1993

In recent publications about data compression, arithmetic codes are often suggested as the state of the art, rather than the moreâ€¦Â (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- Commun. ACM
- 1987

The state of the art in data compression is arithmetic coding, not the better-known Huffman method. Arithmetic coding givesâ€¦Â (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- J. ACM
- 1987

A new one-pass algorithm for constructing dynamic Huffman codes is introduced and analyzed. We also analyze the one-passâ€¦Â (More)

Is this relevant?

Highly Cited

1978

Highly Cited

1978

- IEEE Trans. Information Theory
- 1978

Abstruct-In honor of the twenty-fifth amdversary of Huffman coding, four new results about Huffman codes are presented. 'Ibeâ€¦Â (More)

Is this relevant?

Highly Cited

1976

Highly Cited

1976

- IBM Journal of Research and Development
- 1976

Algorithms for encoding and decoding finite strings over a finite alphabet are described. The coding operations are arithmeticâ€¦Â (More)

Is this relevant?