Enumerative DC-RLL constrained coding

Details Enumerative DC-RLL constrained coding Enumerative DC-RLL constrained coding

2010-12-02

2011-11-08

Pierre, Peguy Jean (Department: 2819)

Coded data generation or conversion

Digital code to digital code converters

To or from run length limited codes

C341S058000

Reexamination Certificate

active

08054207

ABSTRACT:
Systems and methods are provided for encoding and decoding constrained codewords using an enumerative coding graph. The constrained codewords may contain run-length and DC level limits. The enumerative coding graph contains a series of states and each state has multiple branches that lead to other states. Each state in the enumerative coding graph is associated with at least two bits of an enumerative codeword. Configuring the structure of the graph and cardinalities associated with each state allows the encoder to generate a code that conforms to defined constraints.

REFERENCES:
patent: 6492918 (2002-12-01), Rezzi et al.
patent: 6961888 (2005-11-01), Jin et al.
patent: 7161507 (2007-01-01), Tomic
patent: 7265691 (2007-09-01), Tomic
patent: 7612697 (2009-11-01), Chaichanavong et al.
patent: 2001/0040518 (2001-11-01), Coene
patent: 2008/0224905 (2008-09-01), Reznik

Affiliated with

Also associated with

Rating

Enumerative DC-RLL constrained 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 Enumerative DC-RLL constrained coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumerative DC-RLL constrained coding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4274453