Communicating supplemental information over a block erasure...

Details Communicating supplemental information over a block erasure... Communicating supplemental information over a block erasure...

2008-04-09

2011-12-20

Chan, Wing (Department: 2441)

Electrical computers and digital processing systems: multicomput

Remote data accessing

Reexamination Certificate

active

08082320

ABSTRACT:
Methods, systems, and apparatus, including medium-encoded computer program products, for communicating information. In general, one or more aspects of the subject matter described in this specification can be embodied in one or more methods that include obtaining supplemental information to be sent along with primary information over a block erasure channel; calculating numerical residuals for the supplemental information using corresponding prime numbers; outputting the numerical residuals to be sent along with the primary information over the block erasure channel for recovery of the supplemental information at a recipient device using a proper subset of the prime numbers; receiving a proper subset of numerical residuals that were calculated, using corresponding prime numbers, for supplemental information associated with primary information, the primary information and the numerical residuals having been sent over a block erasure channel; and recovering the supplemental information using the proper subset of numerical residuals.

REFERENCES:
patent: 5926649 (1999-07-01), Ma et al.
patent: 7222190 (2007-05-01), Klinker et al.
patent: 7269157 (2007-09-01), Klinker et al.
patent: 7532676 (2009-05-01), Fonseka et al.
patent: 7792325 (2010-09-01), Rhoads et al.
patent: 7831718 (2010-11-01), Chapweske
patent: 2002/0010892 (2002-01-01), Lodge et al.
patent: 2002/0110239 (2002-08-01), Venkatesan et al.
patent: 2006/0230162 (2006-10-01), Chen et al.
patent: 2007/0133420 (2007-06-01), Guven et al.
patent: 2007/0189517 (2007-08-01), Koseki et al.
patent: 2008/0069242 (2008-03-01), Xu et al.
patent: 2008/0112405 (2008-05-01), Cholas et al.
patent: 2008/0232357 (2008-09-01), Chen
patent: 2008/0273458 (2008-11-01), Guo et al.
patent: 2009/0182890 (2009-07-01), Moorer
patent: 2011/0002554 (2011-01-01), Uslubas et al.
patent: WO2005/091585 (2005-09-01), None
patent: WO2006/005334 (2006-01-01), None
Lapidoth, A., The performance of convolutional codes on the block erasure channel using various finite interleaving techniques, Sep. 1994, IEEE Transactions on Information Theory, vol. 40 Issue:5, pp. 1459-1473.
Acharya, et al. “Dissemination-Based Data Delivery Using Broadcast Disks”, IEEE Personal Communications, Dec. 1995, pp. 50-60.
Alstrup, et al. “Introducing Octoshape—A New Technology for Large-Scale Streaming over the Internet”, EBU Technical Review, Jul. 2005, 10 pages.
Bittorrent, “Technology: Peer Accelerated Content Delivery”, downloaded from the internet at http://www.bittorrent.com/dna/technology.html, on Jan. 2, 2008, 3 pages.
Byers, et al. “A Digital Fountain Approach to Asynchronous Reliable Multicast”, IEEE Journal on Selected Areas in Communication, vol. 20, Issue 8, Oct. 2002, pp. 1528-1540.
Goldreich, et al. “Chinese Remaindering with Errors”, IEEE Transactions on Information Theory, vol. 46, Issue 4, Jul. 2000, pp. 1330-1338.
Knuth, The Art of Computer Programming, Second Edition, vol. 2: Seminumerical Algorithms, 1969, pp. 268-276 (11 pages).
Luby, “LT Codes”, Proceedings of the 43rdSymposium on Foundations of Computer Science, Nov. 2002, 10 pages.
Luby, et al. “Practical Loss-Resilient Codes” Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, 1997, 20 pages.
Kazaa, “How Peer-to-Peer (P2) and Kazaa Software Works”, downloaded from the internet at http://www.kazaa.com/us/help
ew—p2p.htm, on Jan. 2, 2008, 2 pages.
McKay, “Information Theory, Interference, and Learning Algorithms, Chapter 50: Digital Fountain Codes”, Cambridge University Press, 2003, pp. 588-596.
Mitzenmacher, “Digital Fountains: A Survey and Look Forward”, IEEE Information Theory Workshop, Oct. 2004, pp. 271-276.
Stone, “Multiple-Burst Error Correction with the Chinese Remainder Theorem”, J. Soc. Indust. Appl. Math, vol. 11, No. 1, Mar. 1963, pp. 74-81.
Wikipedia, “Chinese Remainder Theoreum”, downloaded from the internet at http://en.wikipedia.org/wiki/Chinese—remainder—theoreum on Jan. 3, 2008, 7 pages.
Office Action mailed May 20, 2010 by U.S. Patent Office in U.S. Appl. No. 12/014,702, filed Jan. 15, 2008, 36 pages.
Office Action mailed Oct. 29, 2010 by U.S. Patent Office in U.S. Appl. No. 12/014,702, filed Jan. 15, 2008, 37 pages.
Advisory Action mailed Mar. 15, 2011 by U.S. Patent Office in U.S. Appl. No. 12/014,702, filed Jan. 15, 2008, 4 pages.
Office Action mailed Jun. 30, 2011 by U.S. Patent Office in U.S. Appl. No. 12/014,702, filed Jan. 15, 2008, 20 pages.
Hunter, William E., Attorney, Response filed Aug. 17, 2010 in U.S. Appl. No. 12/014,702, filed Jan. 15, 2008, 21 pages.
Hunter, William E., Attorney, Response filed Dec. 22, 2010 in U.S. Appl. No. 12/014,702, filed Jan. 15, 2008, 17 pages.
Hunter, William E., Attorney, Pre-Appeal Brief filed Mar. 24, 2011 in U.S. Appl. No. 12/014,702, filed Jan. 15, 2008, 5 pages.
Zheng et al., “Chinese Remainder Theorem Based Group Key Management,” Mar. 23-24, 2007, ACM, ACMSE 2007, 6 pages.

Affiliated with

Also associated with

Rating

Communicating supplemental information over a block erasure... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Communicating supplemental information over a block erasure..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Communicating supplemental information over a block erasure... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4300902