Low complexity compression of short messages

Coded data generation or conversion – Digital code to digital code converters

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C341S051000

Reexamination Certificate

active

07999704

ABSTRACT:
A method for data communication, where the data compression and decompression is performed by use of a specific hash table, by which data compression a symbol for each data segment is generated, which symbols are transmitted to the receiver where the symbols are decompressed by use of the specific hash table is modified by the specific hash table being performed as a hash table array, which hash table array generates symbols having at least a hash count and a parity check, in which hash table array the parity check comprises generating of a data string, which data string is compared with a parity stored in the hash table, where if both parities are the same, the data model returns the count in the hash table element for transmission, where a zero count is returned indicating that the data string is not valid in the hash table an no transmission is performed.

REFERENCES:
patent: 5506580 (1996-04-01), Whiting et al.
patent: 2004/0246966 (2004-12-01), Wu et al.
Alistair Moffat, Implementing the PPM Data Compression Scheme, IEEE Transactions on Communications, IEEE Service Center, Piscataway, NJ, US, vol. 38, No. 1 1, Nov. 1990; pp. 1917-1921, XP 000938682; ISSN: 0090-6778; The Whole Document.
Stephan Rein and Clemens Gühmann, Arithmetic Coding—A Short Tutorial and Free Source Code, Internet Article, [Online], Nov. 2005, XP002432479, Retrieved From the Internet: URL:http://www.mdt.tu-berlin.de/Members/rein/files/arithmeticcoding.pdf; [retrieved on May 7, 2007]; The Whole Document.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Low complexity compression of short messages does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Low complexity compression of short messages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low complexity compression of short messages will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2792864

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.