Re: compressing short XML messages without including dictionary or huffman table
- From: Hans-Peter Diettrich <DrDiettrich1@xxxxxxx>
- Date: Fri, 01 Jun 2007 14:53:39 +0200
benedict wrote:
I have to compress some XML messages, each only 300-600 chars long.
There is a very low upper bound on the size of the compressed
messages, so I cannot afford to transmit any dictionary or Huffman
encoding table along with each message, but must 'hardwire' them into
the receiver.
I'd try to encode the invariant parts as fixed patterns.
A compression algorithm cannot know, which parts of a message are repeated in other messages. You can e.g. compress multiple typical (concatenated) messages, and hard code the resulting LZ (or whatever) table into your transceivers.
DoDi
.
- References:
- Prev by Date: compressing short XML messages without including dictionary or huffman table
- Next by Date: Re: compressing short XML messages without including dictionary or huffman table
- Previous by thread: compressing short XML messages without including dictionary or huffman table
- Next by thread: Re: compressing short XML messages without including dictionary or huffman table
- Index(es):
Relevant Pages
|
|
