Coded data generation or conversion – Digital code to digital code converters
Reexamination Certificate
2007-08-20
2010-10-12
JeanPierre, Peguy (Department: 2819)
Coded data generation or conversion
Digital code to digital code converters
C714S015000
Reexamination Certificate
active
07812743
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: 3909721 (1975-09-01), Bussgang et al.
patent: 4365338 (1982-12-01), McRae et al.
patent: 4589112 (1986-05-01), Karim
patent: 5331320 (1994-07-01), Cideciyan et al.
patent: 5432787 (1995-07-01), Chethik
patent: 5455823 (1995-10-01), Noreen et al.
patent: 5608738 (1997-03-01), Matsushita
patent: 5617541 (1997-04-01), Albanese et al.
patent: 5805825 (1998-09-01), Danneels et al.
patent: 5933056 (1999-08-01), Rothenberg et al.
patent: 5953537 (1999-09-01), Balicki et al.
patent: 5970098 (1999-10-01), Herzberg
patent: 5983383 (1999-11-01), Wolf
patent: 5993056 (1999-11-01), Vaman
patent: 6044485 (2000-03-01), Dent et al.
patent: 6073250 (2000-06-01), Luy et al.
patent: 6081909 (2000-06-01), Luby et al.
patent: 6081918 (2000-06-01), Spielman
patent: 6097320 (2000-08-01), Kuki et al.
patent: 6163870 (2000-12-01), Luby et al.
patent: 6178536 (2001-01-01), Sorkin
patent: 6195777 (2001-02-01), Luby et al.
patent: 6223324 (2001-04-01), Sinha et al.
patent: 6307487 (2001-10-01), Luby et al.
patent: 6320520 (2001-11-01), Luby
patent: 6333926 (2001-12-01), Van Heeswyk et al.
patent: 6373406 (2002-04-01), Lubyy et al.
patent: 6411223 (2002-06-01), Haken et al.
patent: 6420982 (2002-07-01), Brown
patent: 6430233 (2002-08-01), Dillon et al.
patent: 6473010 (2002-10-01), Vityaev
patent: 6486803 (2002-11-01), Luby et al.
patent: 6643332 (2003-11-01), Morelos-Zaragoza et al.
patent: 6742154 (2004-05-01), Barnard
patent: 6849803 (2005-02-01), Gretz
patent: 6850736 (2005-02-01), McCune, Jr.
patent: 6856263 (2005-02-01), Shokrollahi et al.
patent: 6909383 (2005-06-01), Shokrollahi et al.
patent: 7030785 (2006-04-01), Shokrollahi et al.
patent: 7068729 (2006-06-01), Shokrollahi
patent: 7168030 (2007-01-01), Ariyoshii et al.
patent: 7418651 (2008-08-01), Luby et al.
patent: 2002/0081977 (2002-06-01), McCune, Jr. et al.
patent: 2003/0058958 (2003-03-01), Shokrollahi et al.
patent: 2007/0195894 (2007-08-01), Shokrollahi et al.
patent: 2007/0300127 (2007-12-01), Watson et al.
patent: 0854650 (1998-07-01), None
patent: 9634463 (1996-10-01), None
patent: 9832231 (1998-07-01), None
patent: WO0018017 (2000-03-01), None
patent: WO0120786 (2001-03-01), None
International Search Report - PCT/US99/021574 - ISA/EPO - Jan. 28, 2000.
International Search Report - PCT/US00/025405 - ISA/EPO - Mar. 1, 2001.
International Preliminary Examination Report - PCT/US00/025405 - Oct. 29, 2001.
European Search Report - EP02007488 - Search Authority - Munich Patent Office - Mar. 24, 2003.
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).
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.
Blomer et al., “An XOR-Based Erasure-Resent Coding Scheme,” ICSI Technical Report No. TR-95-048 (1995).
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), p. 1.
Byers et al., “A Digital Fountain Approach to Reliable Distribution of Bulk Data”, International Computer Science Institute Technical Report TR-98-013 (May 1998).
Gemmell, et al., “A Scalable Multicast Architecture for One-To-Many Telepresentations”, Multimedia Computing and Systems, 1998/ Proceedings. IEEE International Conference on Austin, TX, USA Jun. 28-Jul. 1, 1998, Los Alamitos, CA USA, IEEE Comput. Soc, US 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.
Hershey, et al., “Random Parity Coding (RPC)”, 1996 IEEE International Conference on Communications (ICC) Converging Technologies for Tomorrows Applications. Dallas, Jun. 23-27, 1983, IEEE International Conference on Communications (ICC), New York, IEEE.
Kallel, “Complementary Punctured Convolutional (CPC) Codes and Their Applications”, IEEE Transactions on Communications, IEEE Inc., New York, US, vol. 43, No. 6, Jun. 1, 1995, pp. 2005-2009.
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).
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).
Luby et al., “Improved Low-density Parity-Check Codes Using Irregular Graphs and Belief Propagation”, International Computer Science Institute Technical Report TR-97-044(Nov. 1997).
Luby et al., “Tornado Codes,” Practical Loss-Resilient Codes, 29th Annual ACM Symposium on Theory of Computing (1997).
Narayanan, et al., “Physical Layer Design for Packet Data Over IS-136”, Vehicular Technology Conference, 1997, IEEE 47th Phoenix, AZ, USA May 4-7, 1997, New York, NY, USA, IEEE, US May 4, 1997, pp. 1029-1033.
Nonnenmacher, et al., “Parity-Based Loss Recovery for Reliable Multicast Transmission”, IEEE / ACM Transactions on Networking, IEEE Inc. New York, US, vol. 6, No. 4, Aug. 1, 1998, pp. 349-361.
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.
Seshan et al., “Handoffs In Cellular Wireless Networks: The Daedalus Implementation and Experience,” Wireless Personal Communications, NL; Kluwer Scademic Publishers, vol. 4, No. 2, Mar. 1, 1997, pp. 141-162.
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).
Bitner, J.R., et al.: “Efficient generation of the binary reflected Gray code and its Applications,” Communications of the ACM (1976).
Clark, C.C. et al.: “Error Correction Coding for Digital Communications, System Applications,” 1981, Plenum Press New York, pp. 339-341.
Digital Fountain: “Raptor code specification for MBMS file download,” 3GPP SA4 PSM AD-HOC #31 (May 21, 2004) XP002355055 pp. 1-6.
Digital Fountain: “Specification Text for Raptor Forward Error Correction,” TDOC S4-050249 of 3GPP TSG SA WG 4 Meeting #34 [Online] (Feb. 25, 2005) pp. 1-23, XP002425167, Retrieved from the Internet: URL:http://www.3gpp.org/ftp/tsg—sa/WG4—CODEC/TSGS4—34/Docs.
Luby, M. et al.: “Efficient Erasure Correction Codes,” 2001, IEEE Transactions on Information Theory. Vo. 47, No. 2, pp. 569-584.
Pursley, M. et al.: A Correction and an Addendum for “Variable-
Digital Fountain Inc.
Jacobs Jeffrey D.
Jean-Pierre Peguy
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-4238638