Data encoding/decoding process

Details Data encoding/decoding process Data encoding/decoding process

1999-06-10

2001-05-29

Tokar, Michael (Department: 2819)

Coded data generation or conversion

Digital code to digital code converters

Adaptive coding

C341S051000, C341S055000, C341S067000, C341S063000

Reexamination Certificate

active

06239727

ABSTRACT:

BACKGROUND AND SUMMARY OF THE INVENTION
The invention concerns a simple text compression method that uses some “negative” information about the text, which is described in terms of antidictionaries. Contrary to other methods that use, as a main tool, dictionaries, i.e. particular sets of words occurring as factors in the text, our method takes advantage from words that do not occur as factors in the text, i.e. that are forbidden. Such sets of words are called here antidictionaries.
More particularly, our invention concerns a data encoding and a data decoding process.
In the encoding process, data are converted from a decoded state
into an encoded state in which:
the data, both in the encoded state and in the decoded state, are in the form of a stream of binary information,
by processing the decoded string of data from left to right, its is current prefix and the next binary information being considered,
a list of binary patterns being registered, in which for each is emphasized the last binary information and the corresponding prefix,
a comparison is made between the current prefix of the decoded string and the prefixes of registered patterns.
The list of patterns is a set of patterns that do not occur and that when a prefix of the decoded string matches with a prefix of a registered pattern, the next binary information of the decoded string is omitted from the decoded stream to make the encoded stream.
In the decoding process, data are converted from an encoded state into a decoded state in which:
the data, both in the encoded state and in the decoded state, are in the form of a stream of binary information,
by processing the encoded string of data from left to right, its current prefix being considered,
a list of binary patterns being registered, in which for each is emphasized the last binary information and the corresponding prefix,
a comparison is made between the current prefix of the decoded string and the prefixes of registered patterns.
The list of patterns is a set of patterns that do not occur and that when a prefix of the decoded string matches with a prefix of a registered pattern, a binary information opposite to the next binary information of the registered matching pattern is inserted in the encoded stream to make the decoded stream.
In preferred embodiments:
the list of registered patterns is finite,
patterns are binary words,
an algorithm is used to compute the list of registered patterns,
during the encoding process, the data stream is read a first time to construct the list of registered patterns and a second time to convert said data stream,
an encoder sends a message z in the form (x, y, &sgr;(n)) to a decoder, where x is a description of a list of the registered patterns, y is the encoded data stream and &sgr;(n) is the usual binary code of the length n of the data stream.


REFERENCES:
patent: 5455577 (1995-10-01), Slivka et al.
patent: 5818873 (1998-10-01), Wall et al.
patent: 5877711 (1999-03-01), Craft
patent: 5973626 (1999-10-01), Berger et al.
patent: 6088699 (2000-07-01), Gampper et al.

Affiliated with

Also associated with

Rating

Data encoding/decoding process does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Data encoding/decoding process, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data encoding/decoding process will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2474622