Coded data generation or conversion – Digital code to digital code converters
Reexamination Certificate
2006-06-06
2006-06-06
JeanPierrre, Peguy (Department: 2819)
Coded data generation or conversion
Digital code to digital code converters
C714S015000
Reexamination Certificate
active
07057534
ABSTRACT:
An encoder uses an input file of data and a key to produce an output symbol. An output symbol with key I is generated by determining a weight, W(I), for the output symbol to be generated, selecting W(I) of the input symbols associated with the output symbol according to a function of I, and generating the output symbol's value B(I) from a predetermined value function F(I) of the selected W(I) input symbols. An encoder can be called repeatedly to generate multiple output symbols. The output symbols are generally independent of each other, and an unbounded number (subject to the resolution of I) can be generated, if needed. A decoder receives some or all of the output symbols generated. The number of output symbols needed to decode an input file is equal to, or slightly greater than, the number of input symbols comprising the file, assuming that input symbols and output symbols represent the same number of bits of data.
REFERENCES:
patent: 4365338 (1982-12-01), McRae et al.
patent: 5432787 (1995-07-01), Chethik
patent: 5608738 (1997-03-01), Matsushita
patent: 5617541 (1997-04-01), Albanese et al.
patent: 5805825 (1998-09-01), Danneels et al.
patent: 5983383 (1999-11-01), Wolf
patent: 5993056 (1999-11-01), Vaman et al.
patent: 6073250 (2000-06-01), Luby et al.
patent: 6081909 (2000-06-01), Luby et al.
patent: 6081918 (2000-06-01), Spielman
patent: 6163870 (2000-12-01), Luby et al.
patent: 6178536 (2001-01-01), Sorkin
patent: 6195777 (2001-02-01), Luby et al.
patent: 6307487 (2001-10-01), Luby
patent: 0 854 650 (1998-07-01), None
patent: WO 96 34463 (1996-10-01), None
Alon et al., “Linear Time Erasure Codes With Nearly Optimal Recovery,” Proceedings of the Annual Symposium On Foundations Of Computer Science, US, Los Alamitos, IEEE Comp. Soc. Press, vol. Symp. 36, pp. 512-516 (Oct. 23, 1995), XP 000557871.
Bigloo et al. “A Robust Rate-Adaptive Hybrid ARQ Scheme For Frequency-Hopped Spread-Spectrum Multiple-Access Communication Systems” IEEE Journal On Selected Areas In Communications, US, IEEE Inc, New York, (Jun. 1, 1994) pp. 917-924, XP0000464977.
Blömer et al., “An XOR-Based Erasure-Resilient Coding Scheme,” ICSI Technical Report No. TR-95-048 (1995) [avail. at ftp://ftp.icsi.berkeley.edu/pub/techreports/1995/tr-95-048.pdf], p. 1, no month.
Byers et al., “A Digital Fountain Approach to Reliable Distribution of Bulk Data”, International Computer Science Institute Technical Report TR-98-013 (May, 1998) [available at ftp://ftp.icsi.berkeley.edu/pub/techrepors/1998/tr-98-013.pdf], p. 1.
Byers et al., “Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed Up Downloads,” International Computer Science Institute Technical Report TR-98-021 (1998) [available at http://www.icsi.berkeley.edu/-luby/PAPERS/mindown.ps] p. 1, no month
Byers et al. “Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed up Downloads” Proceeding IEEE Infocom. The Conference on Computer Communications, US New York, (Mar. 21, 1999) pp. 275-283, XP000866811.
Esaki et al. “Reliable IP Multicast Communication Over ATM Networks Using Forward Error Correction Policy” IEICE Transactions On Communications, JP, Institute of Electronics Information and Comm. ENG. Tokyo, vol. E78-V, No. 12, (Dec. 1995), pp. 1622-1637, XP000556183.
Luby et al., “Analysis of Low Density Codes and Improved Designs Using Irregular Graphs”, International Computer Science Institute Technical Report TR-97-045 (Nov., 1997) [available at ftp://ftp.icsi.berkeley.edu/pub/techreports/1997/tr-97-045.pdf].
Luby et al., “Analysis of Random Processes via And-Or Tree Evaluation, ” ICSI Technical Report No. TR-97-042 (1997) and Proceedings of the 9th Annual ACM Symposium on Discrete Algorithms (1998) [available at ftp://ftp.icsi.berkeley.edu/pub/techreports/1997/tr-97-042.pdf, no month.
Luby et al., “Improved Low-density Partly-Check Codes Using Irregular Graphs and Belief Propagation”, International Computer Science Institute Technical Report TR-97-044 (Nov., 1997) [available at ftp://ftp/icsi.berkely.edu/pub/techreports/1997/tr-97-044.pdf].
Luby et al., “Tornado Codes,”Practical Loss-Resilient Codes, 29th Annual ACM Symposium on Theory of Computing (1997).
Pursley et al. “Variable-Rate Coding For Meteor-Burst Communications” IEEE Transactions on Communications, US, IEEE Inc. New York (1989) vol. 37, No. 11, pp. 1105-1112, XP000074533, no month.
Seshan et al., “Handoffs In Cellular Wireless Networks: The Daedalus Implementation and Experience” Wireless Personal Communications, NL, Kluwer Academic Publishers, vol. 4, No. 2, Mar. 1, 1997, pp. 141-162, XP000728589.
Shacham, N., “Packet Recovery And Error Correction In High-Speed Wide-Area Networks,” Proceedings Of The Military Communications Conference, (Milcom), US, New York, IEEE, vol. 1, pp. 551-557, (1989), XP 000131676, no month.
Digital Fountain Inc.
JeanPierrre Peguy
Townsend and Townsend / and Crew LLP
LandOfFree
Information additive code generator and decoder for... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Information additive code generator and decoder for..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Information additive code generator and decoder for... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3666913