Nonlinear run-length coding

Details Nonlinear run-length coding Nonlinear run-length coding

1996-04-22

1998-04-21

Williams, Howard L.

Coded data generation or conversion

Digital code to digital code converters

To or from run length limited codes

H03M 700

Patent

active

057422443

ABSTRACT:
An input string of binary data bits which is a random sequence of 0s and 1s is selectively spaced encoded into an output string of binary channel bits which is a sequence of 0s and 1s. An input string of binary data bits are recursively encoded according to run-length selection means having rate p/q where p is the number of input data bits that are encoded into q-channel bits. The channel bits obey constraints such that the encoding specifies an ordered n element list of integers that are the lengths of the selected runs of consecutive zeros, denoted b.sub.0 -1, b.sub.1 -1, . . . , b.sub.n-1 -1, and such that the element list of integers does not contain all the integers between the minimum element, b.sub.0, and the maximum element, b.sub.n-1.

REFERENCES:
patent: 4914438 (1990-04-01), Kameyama
patent: 5287228 (1994-02-01), Hitachi

Affiliated with

Also associated with

Rating

Nonlinear run-length coding does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Nonlinear run-length coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nonlinear run-length coding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2061974