Coded data generation or conversion – Digital code to digital code converters – To or from particular bit symbol
Reexamination Certificate
2007-08-20
2009-12-15
Nguyen, Linh V (Department: 2819)
Coded data generation or conversion
Digital code to digital code converters
To or from particular bit symbol
C341S051000, C341S050000, C341S094000
Reexamination Certificate
active
07633413
ABSTRACT:
A method for processing a chain reaction codes includes first selecting a source symbol which is associated an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an attempt to produce an output symbol of degree one. The inactivation process can be repeated either successively until an output symbol of degree one is identified, and/or whenever the decoding process is unable to locate an output symbol of degree one.
REFERENCES:
patent: 5153591 (1992-10-01), Clark
patent: 6073250 (2000-06-01), Luby et al.
patent: 6307487 (2001-10-01), Luby et al.
patent: 6320520 (2001-11-01), Luby
patent: 6411223 (2002-06-01), Haken et al.
patent: 6486803 (2002-11-01), Luby et al.
patent: 6633856 (2003-10-01), Richardson et al.
patent: 6677864 (2004-01-01), Khayrallah
patent: 6678855 (2004-01-01), Gemmell
patent: 6748441 (2004-06-01), Gemmell
patent: 6820221 (2004-11-01), Fleming
patent: 6856263 (2005-02-01), Shokrollahi et al.
patent: 6895547 (2005-05-01), Eleftheriou et al.
patent: 6909383 (2005-06-01), Shokrollahi et al.
patent: 6995692 (2006-02-01), Yokota et al.
patent: 7030785 (2006-04-01), Shokrollahi et al.
patent: 7057534 (2006-06-01), Luby
patent: 7068729 (2006-06-01), Shokrollahi et al.
patent: 7139960 (2006-11-01), Shokrollahi et al.
patent: 7164370 (2007-01-01), Mishra
patent: 7243285 (2007-07-01), Foisy et al.
patent: 2005/0102598 (2005-05-01), Shokrollahi et al.
patent: 2008/0309525 (2008-12-01), Shokrollahi et al.
patent: 1241795 (2002-09-01), None
patent: WO 96034463 (1996-10-01), None
patent: WO 03105350 (2003-12-01), None
Byers, “A Digital Fountain Approach to Reliable Distribution of Bulk Data”, Computer Communications Review, Association for Computing Machinery, New York (US), vol. 28, Oct. 1998, pp. 56-67.
Luby et al., “Improved Low-Density Parity-Check Codes Using Irregular Graphs and Belief Propogation”, Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on Cambridge, MA, USA Aug. 16-21, 1998, New York, NY, USA, IEEE, US August 16, 199.
Shokrollahi et al., “Design of Efficient Easure Codes with Differential Evolution”, IEEE International Symposium on Information Theory, Jun. 25, 2000, pp. 5-5.
Yin et al., “Modified Belief-Propogation algorithm for Decoding of Irregular Low-Density Parity-Check Codes”, Electronics Letters, IEE Stevenage, GB, vol. 38, No. 24, 21 Nov. 2002, pp. 1551-1553.
International Search Report - PCT/US03/018353 - International Search Authority - EPO - Sep. 26, 2003.
Karp Richard
Lassen Soren
Shokrollahi M. Amin
Albert Phillip H.
Jacobs Jeffrey D.
Nguyen Linh V
QUALCOMM Incorporated
LandOfFree
Systems and processes for decoding a chain reaction code... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Systems and processes for decoding a chain reaction code..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Systems and processes for decoding a chain reaction code... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4116924