Protection of data from erasures using subsymbol based codes

Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07412641

ABSTRACT:
An encoder uses output symbol subsymbols to effect or control a tradeoff of computational effort and overhead efficiency to, for example, greatly reduce computational effort for the cost of a small amount of overhead efficiency. An encoder reads an ordered plurality of input symbols, comprising an input file or input stream, and produces output subsymbol. The ordered plurality of input symbols are each selected from an input alphabet, and the generated output subsymbols comprise selections among an output subsymbol alphabet. An output subsymbol is generated using a function evaluator applied to subsymbols of the input symbols. The encoder may be called one or more times, each time producing an output subsymbol. Output subsymbols can then be assembled into output symbols and transmitted to their destination. The functions used to generate the output subsymbols from the input subsymbols can be XOR's of some of the input subsymbols and these functions are obtained from a linear code defined over an extension field of GF(2) by transforming each entry in a generator or parity-check matrix of this code into an appropriate binary matrix using a regular representation of the extension field over GF(2). In a decoder, output subsymbols received by the recipient are obtained from output symbols transmitted from one sender that generated those output symbols based on an encoding of an input sequence (file, stream, etc.).

REFERENCES:
patent: 5524025 (1996-06-01), Lawrence et al.
patent: 5642365 (1997-06-01), Murakami et al.
patent: 6005477 (1999-12-01), Deck et al.
patent: 6079042 (2000-06-01), Vaman et al.
patent: 6088330 (2000-07-01), Bruck et al.
patent: 6307487 (2001-10-01), Luby
patent: 7240236 (2007-07-01), Cutts et al.
patent: 7254754 (2007-08-01), Hetzler et al.
patent: 2003/0058958 (2003-03-01), Shokrollahi et al.
patent: WO 96/34463 (1996-10-01), None
Roth, R., et al., “A Construction of Non-Reed-Solomon Type MDS Codes”, IEEE Transactions of Information Theory, vol. 35, No. 3, May 1989, pp. 655-657.
Roth, R., “On MDS Codes via Cauchy Matrices”, IEEE Transactions on Information Theory, vol. 35, No. 6, Nov. 1989, pp. 1314-1319.
Feng, G., Error Correcting Codes over Z2m for Algorithm-Based Fault-Tolerance, IEEE Transactions on Computers, vol. 43, No. 3, Mar. 1994, pp. 370-374.
Blömer et al. “An XOR-based erasure-resilent coding scheme” Technical report, TR-95-048, 1995, pp. 1-19, XP002181848.
Pless and WC Huffman EDS V S: Algebraic geometry codes, Handbook of Coding Theory, 1998, pp. 871-961, XP002300927.

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

Protection of data from erasures using subsymbol based codes does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Protection of data from erasures using subsymbol based codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Protection of data from erasures using subsymbol based codes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3993191

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