Message encoding with irregular graphing

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

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

H03M 1300

Patent

active

061638706

ABSTRACT:
An encoded message, includes a plurality of data items and a plurality of redundant data items. Each of the plurality of redundant data items corresponds to a number of the data items, with respective redundant data items corresponding to different numbers of data items.

REFERENCES:
patent: 4599722 (1986-07-01), Mortimer
patent: 4958348 (1990-09-01), Berlekamp et al.
patent: 4958350 (1990-09-01), Worley, III et al.
patent: 5115436 (1992-05-01), McAuley
patent: 5365530 (1994-11-01), Yoshida
patent: 5440670 (1995-08-01), Frazier
patent: 5544179 (1996-08-01), Hartwell
patent: 5642365 (1997-06-01), Murakami et al.
patent: 5719884 (1998-02-01), Roth et al.
Daniel A. Spielman. Linear-Time Encodable and Decodable Error-Correcting Codes--Journal Version, IEEE IT 96. Massachusetts Institute of Technology. pp. 1-20.
Daniel A. Spielman. Computationally Efficient Error-Correcting Codes and Holographic Proofs--Yale University (1992). Massachusetts Institute of Technology Jun. 1995 pp. 1-147.
Luigi Rizzo--Effective erassure codes for reliable computer communication protocols--University of Italy. Jan. 9, 1997, pp. 1-10.
Daniel A. Spielman. Linear-Time Encodable and Decodable Error-Correcting Codes--Dept. of Computer Science. U.C. Berkeley Berkeley, CA, pp. 1-20.
Sipser et al. Expander Codes--Massachusetts Institute of Technology. Cambridge. MA.. 12 pages.
G. David Forney, Jr. The Forward-Backward Algorithm--Motorola. Inc Mansfield. MA Oct. 1, 1986. pp.432-446.
R. G. Gallagher. Low-Density Parity-Check Codes--1963 M.I.T. Press. Cambridge, MA, 106 pages.
Sipser et al. Expander Codes--Journal Version. IEEE IT 1996. Massachusetts Institute of Technology. pp. 1-28.
Daniel A. Spielman. Linear-Time Encodable and Decodable Error-Correcting Codes--Conference Version. STOC 95. Massachusetts Institute of Technology. 10 pages.
Luigi Rizzo.--A Reliable Multicast data Distribution Protocol based on software FEC techniques--University of Italy. Feb. 20, 1997. pp. 1-6.
Luigi Rizzo--On the feasibility of software FEC--University of Italy. Jan. 31, 1997. pp. 1-16.
A. J. McAuley. Reliable Boardband Communication Using a Burst Erasure Correcting Code--Computer Communication Research Group. Morristown. NJ. pp. 297-306.
E. W Biersack. Performance Evaluation of Forward Error Correction in ATM Networks--Institut EURECOM. France. Aug. 1992. pp. 248-257.
David J.C. MacKay. Good Error-Correcting Codes based on Very Sparse Matrices--Cavendish Labs. U.K. Nov. 2, 1996. pp. 1-50.
Gelfand et al.. On The Complexity Of Coding--2nd Intl Symposium on Information Theory. Tsahkadsor Armeia. USSR. Sep. 2-8, 1971. pp. 177-184.
Bassalygo et al. Problems Of Complexity In The Theory Of Correcting Codes--Plenum Publishing Corp.. 1978. pp. 166-175.
Vvedenskaya et al., Systematic Codes That Can Be Realized By Simple Circuits--Plenum Publishing Corp. 1979. 246-254.
MacKay et al., Good Codes based on Very Sparse Matrices--Cavendish Labs. Cambridge. U.K., 7 pages.
Alon et al.. Construction of Asymptotically Good Low-Rate Error-Correcting Codes through Pseudo Random Graphs--IEEE Trans. on Information Theory. vol. 38, No. 2, Mar. 1992. pp. 509-516.
Cheng et al., Some High-Rate Near Capacity Codes for the Caussian Channel--34th Allerton Conference on Communications, Control and Computing. Oct. 4, 1996. pp. 1-10.
Zyablov et al. Decoding Complexity of Low-Density Codes For Transmission In A Channel With Erasures--Vol. 10. No. 1, pp. 1-021, last revision Aug. 20, 1973.
R. Michael Tanner. A Recursive Approach to Low Complexity Codes--Transactions on Information Theory. vol. IT-27, No. 5. Sep. 1981. pp.533-547.
Jung-Fu Cheng. On the Construction of Efficient Multilevel Coded Modulations--IEEE Intl. Symposium on Information Theory. 1997. pp. 1-12.

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

Message encoding with irregular graphing does not yet have a rating. At this time, there are no reviews or comments for this patent.

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

Rate now

     

Profile ID: LFUS-PAI-O-278253

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