Granted Patent
B2
US 12,261,949 · App. 17/460,991 · Granted Mar 25, 2025
Network coding-based post-quantum cryptography
Inventors:
Muriel Medard (Belmont, MA); Alejandro Cohen (Brookline, MA); Rafael Gregorio Lucas D'Oliveira (Somerville, MA); Salman Salamatian (Boston, MA)
Assignee:
Massachusetts Institute of Technology
View Patent ↗
Loading inventors, assignments & file history…
Abstract
A system and method provide a hybrid communication scheme that achieves high communication rates with post-quantum computational security guarantees. Messages to be securely communicated are first mixed using an individually secure encoding, such as a linear network code, and some of the encoded messages are further encrypted. The encrypted and unencrypted messages are sent via different communications channels. Each unencrypted message becomes almost as secure as the encrypted messages because of the pre-mixing, since decoding any one of the messages requires all of the messages, including the encrypted messages. Thus, a very few encrypted messages may be used, allowing the rate of communication to approach one as the number of channels increases. This is particularly beneficial when a classical public-key cryptosystem can only be used in part of the data transmitted or stored, in the presence of noisy channels, in distributed data storage, and other applications.
Claims (25)
1. A method of securely communicating a message to an individual, the method comprising:
receiving, using a first data channel, first data that comprise an encryption of a first portion of an encoding of the message using an individually secure code with a generator matrix;
receiving, using a second data channel, second data that comprise a second portion of the encoding of the message using the generator matrix, wherein the first data channel and the second data channel comprise different transmission media and wherein receiving the first message or receiving the second message comprises correcting one or more errors;
decrypting the first data to retrieve the first portion of the encoding of the message;
retrieving the message by multiplying the first portion of the encoding and the second portion of the encoding by the inverse of the generator matrix; and
displaying the message to the individual.
2. The method according to claim 1 , wherein the first data channel and the second data channel comprise different utilization times of a single transmission medium.
3. The method according to claim 1 , wherein the encryption comprises a public-key encryption.
4. The method according to claim 1 , wherein the encryption comprises a post-quantum encryption.
5. The method according to claim 1 , wherein recovering comprises decoding the decrypted first encoding and the second encoding according to the individually secure linear code.
6. The method according to claim 5 , wherein the individually secure linear code comprises a linear network code.
7. An apparatus for securely communicating a message to an individual, the apparatus comprising:
a computing processor; and
a non-volatile memory storing computer program code that, when executed by the computing processor, performs the processes of:
receiving, using a first data channel, first data that comprise an encryption of a first portion of an encoding of the message using an individually secure code with a generator matrix;
receiving, using a second data channel, second data that comprise a second portion of the encoding of the message using the generator matrix, wherein the first data channel and the second data channel comprise different transmission media and wherein receiving the first message or receiving the second message comprises correcting one or more errors;
decrypting the first data to retrieve the first portion of the encoding of the message;
retrieving the message by multiplying the first portion of the encoding and the second portion of the encoding by the inverse of the generator matrix; and
displaying the message to the individual.
8. The apparatus according to claim 7 , wherein the first data channel and the second data channel comprise different utilization times of a single transmission medium.
9. The apparatus according to claim 7 , wherein the encryption comprises a public-key encryption.
10. The apparatus according to claim 7 , wherein the encryption comprises a post-quantum encryption.
11. The apparatus according to claim 7 , wherein recovering comprises decoding the decrypted first encoding and the second encoding according to the individually secure linear code.
12. The method according to claim 11 , wherein the individually secure linear code comprises a linear network code.
13. The method according to claim 1 , wherein the individually secure code uses a finite field having a characteristic larger than 2.
Assignments (3)
GOVERNMENT INTEREST AGREEMENT
Recorded Mar 24, 2025
From: MASSACHUSETTS INSTITUTE OF TECHNOLOGY
To: THE GOVERNMENT OF THE UNITED STATES OF AMERICA AS REPRESENTED BY THE SECRETARY OF THE NAVY
Reel/Frame 070611/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST
Recorded Sep 16, 2021
From: MEDARD, MURIEL; COHEN, ALEJANDRO; D'OLIVEIRA, RAFAEL GREGORIO LUCAS; SALAMATIAN, SALMAN
To: MASSACHUSETTS INSTITUTE OF TECHNOLOGY
Reel/Frame 057496/0808 →
ASSIGNMENT OF ASSIGNOR'S INTEREST
Recorded Aug 31, 2021
From: MEDARD, MURIEL; COHEN, ALEJANDRO; D'OLIVEIRA, RAFAEL GREGORIO LUCAS; SALAMATIAN, SALMAN
To: MASSACHUSETTS INSTITUTE OF TECHNOLOGY
Reel/Frame 057338/0582 →
Continuity (2)
Provisional Application
63072430
· Aug 31, 2020
References Cited (400)
US 5577056A
· Malik et al.
· 1996
[cited by applicant]
US 6128773A
· Snider
· 2000
[cited by applicant]
US 6621851B1
· Agee et al.
· 2003
[cited by applicant]
US 6885653B2
· Choi et al.
· 2005
[cited by applicant]
US 7064489B2
· Price
· 2006
[cited by applicant]
US 7071853B2
· Price
· 2006
[cited by applicant]
US 7095343B2
· Xie et al.
· 2006
[cited by applicant]
US 7164691B2
· Knapp et al.
· 2007
[cited by applicant]
US 7283564B2
· Knapp et al.
· 2007
[cited by applicant]
US 7349440B1
· Chou et al.
· 2008
[cited by applicant]
US 7408938B1
· Chou et al.
· 2008
[cited by applicant]
US 7414978B2
· Lun et al.
· 2008
[cited by applicant]
US 7529198B2
· Jain et al.
· 2009
[cited by applicant]
US 7706365B2
· Effros et al.
· 2010
[cited by applicant]
US 7760728B2
· Chou et al.
· 2010
[cited by applicant]
US 7821980B2
· Chakrabarti et al.
· 2010
[cited by applicant]
US 7876677B2
· Cheshire
· 2011
[cited by applicant]
US 7912003B2
· Radunovic et al.
· 2011
[cited by applicant]
US 7945842B2
· He
· 2011
[cited by applicant]
US 8040836B2
· Wu et al.
· 2011
[cited by applicant]
US 8068426B2
· Sundararajan et al.
· 2011
[cited by applicant]
US 8130776B1
· Sundararajan et al.
· 2012
[cited by applicant]
US 8279781B2
· Lucani et al.
· 2012
[cited by applicant]
US 8451756B2
· Lucani et al.
· 2013
[cited by applicant]
US 8482441B2
· Medard et al.
· 2013
[cited by applicant]
US 8504504B2
· Liu
· 2013
[cited by applicant]
US 8571214B2
· Lima et al.
· 2013
[cited by applicant]
US 20040203752A1
· Wojaczynski et al.
· 2004
[cited by applicant]
US 20050047516A1
· Grolmusz
· 2005
[cited by examiner]
US 20060088157A1
· Fujii
· 2006
[cited by examiner]
US 20060224760A1
· Yu et al.
· 2006
[cited by applicant]
US 20060247952A1
· Muraca
· 2006
[cited by applicant]
US 20070116027A1
· Ciavaglia et al.
· 2007
[cited by applicant]
US 20080259796A1
· Abousleman et al.
· 2008
[cited by applicant]
US 20090153576A1
· Keller
· 2009
[cited by applicant]
US 20090175320A1
· Haustein et al.
· 2009
[cited by applicant]
US 20100014669A1
· Jiang
· 2010
[cited by applicant]
US 20100111165A1
· Kim et al.
· 2010
[cited by applicant]
US 20110238855A1
· Korsunsky et al.
· 2011
[cited by applicant]
EP 1638239A1
· 2006
[cited by applicant]
WO WO2007109216A1
· 2007
[cited by applicant]
WO WO2010005181A2
· 2010
[cited by applicant]
WO WO2010025362A2
· 2010
[cited by applicant]
WO WO2011043754A1
· 2011
[cited by applicant]
WO WO2011119909A1
· 2011
[cited by applicant]
WO WO2012167034A2
· 2012
[cited by applicant]
WO WO2013006697A2
· 2013
[cited by applicant]
WO WO2013067488A1
· 2013
[cited by applicant]
WO WO2013116456A1
· 2013
[cited by applicant]
WO WO2014159570A1
· 2014
[cited by applicant]
WO WO2014160194A3
· 2014
[cited by applicant]
WO WO2021115670A1
· 2021
[cited by applicant]
Agrawal et al.; “A Comparative Survey on Symmetric Key Encryption Techniques”; International Journal on Computer Science and Engineering (IJSCE); vol. 4 No. 5; May 2012; 6 Pages.
[cited by applicant]
Andrews et al.; “What Will 5G Be?”; IEEE JSAC Special Issue on 5G Wireless Communication Systems; vol. 32, No. 6; 2014; 17 Pages.
[cited by applicant]
Augot et al.; “Initial recommendations of long-term secure post-quantum systems”; PQCRYPTO EU; Horizon 2020; Submitted 7, 2015; 10 Pages.
[cited by applicant]
Auradkar et al.; “Data Infrastructure at LinkedIn”; 2012 IEEE 28
[cited by applicant]
Baldi et al.; “Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC Codes”; 2007 IEEE International Symposium on Information Theory; IEEE, 2007; 5 Pages.
[cited by applicant]
Baldi; “LDPC codes in the McEliese cryptosystem: attacks and countermeasures”; Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes 23; 2009; 15 Pages.
[cited by applicant]
Bernstein et al.; “Attacking and defending the McEliese cryptosystem”; International Workshop on Post-Quantum Cryptography; 2008; 16 Pages.
[cited by applicant]
Bernstein; “Introduction to post-quantum cryptography”; Post Quantum Cryptography; Springer, 2009; 14 Pages.
[cited by applicant]
Bhattad et al.; “Weakly Secure Network Coding”; NetCod; Apr. 7, 2005; 6 Pages.
[cited by applicant]
Borthakur et al.; “Apache Hadoop Goes Realtime at Facebook”; Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data; 2011; 10 Pages.
[cited by applicant]
Calder et al.; “Windows Azure Storage: A Highly Available Cloud Storage Service with Strong Consistency”; Proceedings of the 23
[cited by applicant]
Chang et al.; “Bigtable: A Distributed Storage System for Structured Data”; OSDI '06: 7
[cited by applicant]
Chen et al.; “On Secure Communication over the Multiple Access Channel”; 2016 International Symposium on Information Theory and Its Applications (ISITA); IEEE, 2016; 5 Pages.
[cited by applicant]
Chen et al.; “On the Individual Secrecy Rate Region for the Broadcast Channel with an External Eavesdropper”; 2015 IEEE International Symposium on Information Theory (ISIT); IEEE, 2015; 5 Pages.
[cited by applicant]
Cloud et al.; “A Coded Generalization of Selective Repeat ARQ”; 2015 IEEE Conference on Computer Communications (INFOCOM); IEEE, 2015; 9 Pages.
[cited by applicant]
Cohen et al.; “Adaptive Causal Network Coding with Feedback for Multipath Multi-hop Communications”; IEEE Transactions on Communications; vol. 69, No. 2; Oct. 25, 2020; 20 Pages.
[cited by applicant]
Cohen et al.; “Adaptive Causal Network Coding with Feedback”; IEEE Transactions on Communications; vol. 68, No. 7; Apr. 2020; 16 Pages.
[cited by applicant]
Cohen et al.; “Secure Multi-Source Multicast”; IEEE Transactions on Communications; vol. 67, No. 1; 2018; 16 Pages.
[cited by applicant]
DeCandia et al.; “Dynamo: Amazon's Highly Available Key-value Store”; ACM SIGOPS operating systems review; vol. 41, No. 6; 2007; 16 Pages.
[cited by applicant]
Dey et al.; “Sufficiently Myopic Adversaries Are Blind”; IEEE Transactions on Information Theory; vol. 65, No. 9; Sep. 2019; 19 Pages.
[cited by applicant]
Dey et al.; “The Interplay of Causality and Myopia in Adversarial Channel Models”; 2019 IEEE International Symposium on Information Theory (ISIT); IEEE, 2019; 5 pages.
[cited by applicant]
Dimakis et al.; “A Survey on Network Codes for Distributed Storage”; Proceedings of the IEEE; vol. 99, No. 3; 2011; 13 Pages.
[cited by applicant]
Dimakis et al.; “Network Coding for Distributed Storage Systems”; IEEE transactions on information theory; vol. 56, No. 9; 2010; 12 Pages.
[cited by applicant]
Ding et al.; “Cryptanalysis of HFEv and Internal Perturbation of HFE”; International Workshop on Public Key Cryptography; 2005; 14 Pages.
[cited by applicant]
El Rouayheb et al.; “Secure Network Coding for Wiretap Networks of Type II”; IEEE Transactions on Information Theory; vol. 58, No. 3; 2012; 23 Pages.
[cited by applicant]
El Rouayheb et al.; “On Wiretap Networks II”; 2007 IEEE International Symposium on Information Theory; IEEE, 2007; 5 Pages.
[cited by applicant]
Faugère et al.; “A Distinguisher for High Rate McEliece Cryptosystems”; IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers; vol. 59, No. 10; 2013; 23 Pages.
[cited by applicant]
Ghemawat et al.; “The Google File System”; Proceedings on the nineteenth ACM Symposium on Operating systems principles; 2003; 15 Pages.
[cited by applicant]
Goldenbaum et al.; “The Multiple-Access Channel with an External Eavesdropper: Trusted vs. Untrusted Users”; 2015 49
[cited by applicant]
GS Association; “The 5G era in the US”; Mar. 2018; 39 Pages.
[cited by applicant]
Hallgren et al.; “Fast Quantum Algorithms for Computing the Unit Group and Class Group of a Number Field”; Proceedings of the thirty-seventh annual ACM symposium on Theory of Computing; 2005; 10 Pages.
[cited by applicant]
Hallgren et al.; “Polynomial-Time Quantum Algorithms for Pell's Equation and the Principal Ideal Problem”; Journal of the ACM (JACM); vol. 54, No. 1; 2007; 21 Pages.
[cited by applicant]
He et al.; “Secure Communication with a Byzantine Relay”; 2009 IEEE International Symposium on Information Theory; IEEE, 2009; 5 Pages.
[cited by applicant]
Ho et al.; “Byzantine Modification Detection in Multicast Networks With Random Network Coding”; IEEE Transactions On Information Theory; vol. 54, No. 6; Jun. 2008; 6 Pages.
[cited by applicant]
Kadhe et al.; “On a Weakly Secure Regenerating Code Construction for Minimum Storage Regime”; Fifty Second Annual Allerton Conference on Communication, Control, and Computing (Allerton); IEEE, Oct. 2014; 8 Pages.
[cited by applicant]
Kadhe et al.; “Weakly Secure Regenerating Codes for Distributed Storage”; 2014 International Symposium on Network Coding (NetCod); IEEE, 2014; 15 Pages.
[cited by applicant]
Karzand et al.; “Low Delay Random Linear Coding Over a Stream”; Fifty-Second Annual Allerton Conference; IEEE, 2014; 8 Pages.
[cited by applicant]
Kobayashi et al.; “Secure multiplex coding to attain the channel capacity in wiretap channels”; arXiv preprint cs/0509047v1[cs.IT]; Sep. 16, 2005; 15 Pages.
[cited by applicant]
Landais et al.; “An efficient attack of a McEliece cryptosystem variant based on convolutional codes”; International Workshop on Post-Quantum Cryptography; 2013; 12 Pages.
[cited by applicant]
Liu et al.; “Security against passive attacks on network coding system—A survey”; Computer Networks 138 (2018); Elsevier B.V; Available online Mar. 19, 2018; 20 Pages.
[cited by applicant]
Löndahl et al.; “A New Version of McEliece PKC Based on Convolutional Codes”; International Conference on Information and Communications Security; 2012; 10 Pages.
[cited by applicant]
Malak et al.; “Delay-Aware Coding in Multi-Hop Line Networks”; 2019 IEEE 5
[cited by applicant]
Malak et al.; “How to Distribute Computation in Networks”; IEEE INFOCOM 2020—IEEE Conference on Computer Communications; IEEE, 2020; 10 Pages.
[cited by applicant]
Mansour et al.; “On the Individual Secrecy Capacity Regions of the General, Degraded, and Gaussian Multi-Receiver Wiretap Broadcast Channel”; IEEE Transactions on Information Forensics and Security; vol. 11, No. 9; Sep.…
[cited by applicant]
Mansour et al.; “Secrecy Measures for Broadcast Channels with Receiver Side Information: Joint vs Individual” 2014 IEEE Information Theory Workshop (ITW 2014); IEEE, 2014; 5 Pages.
[cited by applicant]
Mansour et al.; “The Individual Secrecy Capacity of Degraded Multi-Receiver Wiretap Broadcast Channels”; IEEE, ICC 2015—Communication Theory Symposium; IEEE, 2015; 6 Pages.
[cited by applicant]
Mansour et al.; “The Individual Secrecy Capacity of the Gaussian SISO and Degraded Gaussian MIMO Multi-Receiver Wiretap Channel”; 2015 IEEE 16
[cited by applicant]
Matsumoto et al.; “Universal Secure Multiplex Network Coding with Dependent and Non-Uniform Messages”; IEEE Transactions on Information Theory; vol. 63, No. 6; 2017; 10 Pages.
[cited by applicant]
Meyer et al.; “A Man-in-the-Middle Attack on UMTS”; Proceedings of the 3
[cited by applicant]
Micciancio et al.; “On the Bit Security of Cryptographic Primitives”; Annual International Conference on the Theory and Applications of Cryptographic Techniques; 2018; 26 Pages.
[cited by applicant]
Minder et al.; “Cryptanalysis of the Sidelnikov cryptosystem”; Annual International Conference on the Theory and Applications of Cryptographic Techniques; Advances in Cryptology—Eurocrypt 2007, LNCS; vol. 4515; IACR, 20…
[cited by applicant]
Monico et al.; “Using Low Density Parity Check Codes in the McEliece Cryptosystem”; 2000 IEEE International Symposium on Information Theory (Cat. No. 00CH37060); IEEE, 2000; 1 Page.
[cited by applicant]
Paunkoska et al.; “Improving the Secrecy of Distributed Storage Systems using Interference Alignment”; 2018 14
[cited by applicant]
Rashmi et al.; “Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction”; IEEE Transactions on Information Theory; vol. 57, No. 8; 2011; 20 Pages.
[cited by applicant]
Rivest et al.; “A Method for Obtaining Digital Signatures and Public-Key Cryptosystem”; Communications of the ACM; vol. 21, No. 2; Feb. 1978; 7 Pages.
[cited by applicant]
Saadat et al.; “Multipath multihop mmWave backhaul in ultra-dense small-cell network”; Digital Communications and Networks; vol. 4; Available online Aug. 30, 2018; 7 Pages.
[cited by applicant]
Sarwate; “Coding against myopic adversaries”; 2010 IEEE Information Theory Workshop—ITW 2010; IEEE, 2010; 5 Pages.
[cited by applicant]
Schmidt et al.; “Polynomial Time Quantum Algorithm for the Computation of the Unit Group of a No. Field”; Proceedings of the thirty-seventh annual ACM symposium on Theory of computing; 2005; 6 Pages.
[cited by applicant]
Schneuwly et al.; “Discrete Water Filling Multi-Path Packet Scheduling”; 2020 IEEE International Symposium on Information Theory (ISIT); IEEE, 2020; 6 Pages.
[cited by applicant]
Sendrier; “On the Security of the McEliece Public-Key Cryptosystem”; Information, Coding and Mathematics; Springer, 2002; 23 Pages.
[cited by applicant]
Shor; “Algorithms for Quantum Computation Discrete Logarithms and Factoring”; Proceedings in the 34
[cited by applicant]
Shor; “Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer”; SIAM Review; vol. 41, No. 2; 1999; 28 Pages.
[cited by applicant]
Silva et al.; “Universal Secure Networks Coding via Rank-Metric Codes”; IEEE Transactions on Information Theory; vol. 57, No. 2; 2011; 12 Pages.
[cited by applicant]
Silva et al.; “Universal Weakly Secure Network Coding”; 2009 IEE Information Theory Workshop on Networking and Information Theory; IEEE, 2009; 5 Pages.
[cited by applicant]
SNOB-5G; The First Steps into a Scalable Network Backhauling Solution for 5G; Downloaded Apr. 8, 2022; http://snob-5g.com; 2 Pages.
[cited by applicant]
Wagoner; “Detecting Man-in-the-Middle Attacks against Transport Layer Security Connections with Timing Analysis”; Theses and Dissertations, 1433; 2011; 124 Pages.
[cited by applicant]
Zeng et al.; “Joint Coding and Scheduling Optimization in Wireless Systems with Varying Delay Sensitivities”; 2012 9
[cited by applicant]
Zhang et al.; “P-Coding: Secure Network against Eavesdropping Attacks”; 2010 Proceedings IEEE INFOCOM; IEEE, 2010; 9 pages.
[cited by applicant]
Liu, G. et al., “Low-Complexity Secure Network Coding Against Wiretapping Using Intra/Inter-ge neration Coding;” China Communications; Jun. 2015; 18 Pages.
[cited by applicant]
Othman et al., “Enhancing data security in ad hoc networks based on multipath routing;” J. Parallel Distrib, Comput.; Available online on Mar. 28, 2009; 8 Pages.
[cited by applicant]
Pham et al., “Integrating Classical Preprocessing into an Optical Encryption Scheme;” Article from Entropy, vol. 21, No. 9; Published on Sep. 7, 2019; 14 Pages.
[cited by applicant]
PCT International Search Report and Written Opinion dated Dec. 2, 2021 for International Application No. PCT/US2021/048209; 13 Pages.
[cited by applicant]
“Data Service Options for Spread Spectrum Systems: Radio Link Protocol Type 3;” 3GPP2 C.S0017-010-A; Version 2.0; Sep. 2005; 56 Pages.
[cited by applicant]
Abichar, et al.; “WiMax vs. LTE: Who Will Lead the Broadband Mobile Internet?;” Mobile Computing; IEEE Computer Society; IT Pro May/Jun. 2010; 7 Pages.
[cited by applicant]
Abuzeid, et al.; “IR-HARQ vs. Joint Channel-Network Coding for Cooperative Wireless Communication;” Cyber Journals: Multidisciplinary Journals in Science and Technology, Journal of Selected Areas in Telecommunications (…
[cited by applicant]
Acedanski, et al.; “How Good is Random Linear Coding Based Distributed Network Storage?;” Proc. 1
[cited by applicant]
Adamson, et al.; “Multicast Negative-Acknowledgment (NACK) Building Blocks;” Internet Engineering Task Force (IETF), RFC; vol. 5401; Nov. 2008; 41 Pages.
[cited by applicant]
Adamson, et al.; “NACK-Oriented Reliable (NORM) Transport Protocol;” Internet Engineering Task Force (IETF); RFC; vol. 5740; Nov. 2009; 94 Pages.
[cited by applicant]
Adamson, et al.; “Quantitative Prediction of NACK-Oriented Reliable Multicast (NORM) Feedback;” Proceedings, MILCOM 2000; vol. 2; Oct. 2002; 6 Pages.
[cited by applicant]
Ahlswede, et al.; “Network Information Flow;” IEEE Transactions on Information Theory; vol. 46; No. 4; Jul. 2000; pp. 1204-1216; 13 Pages.
[cited by applicant]
Ahmed, et al.; “On the Scaling Law of Network Coding Gains in Wireless Networks;” IEEE; MILCOM 2007; Oct. 2007; 7 Pages.
[cited by applicant]
Ali, et al.; “Source Coding With Side Information Using List Decoding;” 2010 IEEE International Symposium on Information Theory Proceedings (ISIT); IEEE; Jun. 2010; 5 Pages.
[cited by applicant]
Allman, et al.; “Fast Retransmit / Fast Recovery—TCP Congestion Control;” IETF; Section 3.2; RFC 2581; http://tools.ietf.org/html/rfc2581#section-3.2; Apr. 1999; downloaded on Nov. 2, 2011; 14 Pages.
[cited by applicant]
Armstrong, et al.; “Distributed Storage with Communcation Costs;” IEEE Forty-Ninth Annual Allerton Conference—Allerton House; Sep. 28-30, 2011; pp. 1358-1365; 8 Pages.
[cited by applicant]
Awerbuch, et al.; “On-Line Generalized Steiner Problem;” Proceedings of the 7
[cited by applicant]
Baek, et al.; “An Adaptive ARQ-HARQ interworking scheme in WiMAX Systems”; Computer Networks; vol. 56; Jan. 2012; pp. 1745-1762; 18 Pages.
[cited by applicant]
Baron, et al.; “Coding Schemes for Multislot Messages in Multichannel ALOHA With Deadlines;” IEEE Transactions on Wireless Communications; vol. 1; No. 2; Apr. 2002; pp. 292-301; 10 Pages.
[cited by applicant]
Bellare, et al.; “A Concrete Security Treatment of Symmetric Encryption: Analysis of the DES Modes of Operation;” Proc. 38
[cited by applicant]
Berman, et al.; “Improved Approximations for the Steiner Tree Problem;” Journal of Algorithms; Chapter 39; pp. 325-334; 10 Pages.
[cited by applicant]
Bhadra, et al.; “Looking at Large Networks: Coding vs. Queueing;” Proc. Of the 25
[cited by applicant]
Bharath-Kumar, et al.; “Routing to Multiple Destinations in Computer Networks;” IEEE Transactions on Communications; vol. Com-31; No. 3; Mar. 1983; pp. 343-351; 9 Pages.
[cited by applicant]
Bhargava, et al.; “Forward Error Correction Coding;” Mobile Communications Handbook; Part 1: Basic Principals; 1999; 18 Pages.
[cited by applicant]
Birk, et al.; “Judicious Use of Redundant Transmissions in Multichannel ALOHA Networks with Deadlines;” IEEE Journal on Selected Areas In Communications; vol. 17; No. 2; Feb. 1999; pp. 257-269; 13 Pages.
[cited by applicant]
Bisson, et al.; “Reducing Hybrid Disk Write Latency with Flash-Backed I/O Requests;” Proceedings of the Fifteenth IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Sys…
[cited by applicant]
Bonnin, et al.; “Automatic Multi-Interface Management Through Profile Handling;” Springer; Mobile Networks and Applications; Feb. 2009; pp. 4-17; 14 Pages.
[cited by applicant]
Borokhovich, et al.; “Tight bounds for Algebraic Gossip on Graphs;” Proc. Of the IEEE International Symposium on Information Theory (ISIT); Jun. 13-18, 2010; 14 Pages.
[cited by applicant]
Borst, et al.; “Distributed Caching Algorithms for Content Distribution Networks”; IEEE INFOCOM; 2010 Proceedings IEEE; Mar. 14-19, 2010; 9 Pages.
[cited by applicant]
Borst, et al.; “Distributed Caching Algorithms for Content Distribution Networks;” Power Point Presentation; BCAM Seminar; Bilbao, Sep. 30, 2010; 36 Pages.
[cited by applicant]
Bui, et al.; “A Markovian Approach to Multipath Data Transfer in Overlay Networks;” IEEE Transactions on Parallel and Distributed Systems; vol. 21; No. 10; Oct. 2010; pp. 1398-1411; 14 Pages.
[cited by applicant]
Byers, et al.; “Securing bulk content almost for free”; Science Direct; Computer Communications; vol. 29; Dec. 2004; 11 Pages.
[cited by applicant]
Cai, et al.; Secure Network Coding; IEEE International Symposium on Information Theory 2002; Jun. 30-Jul. 5, 2002; p. 323; 1 Page.
[cited by applicant]
Cai, et al.; “Theory of Secure Network Coding;” IEEE Proc. Vol. 99; No. 3; pp. 421-437; Mar. 2011; 17 Pages.
[cited by applicant]
Calmon et al., “Lists that are Smaller than their Parts: A Coding Approach to Tunable Secrecy;” Proceedings of the IEEE 50
[cited by applicant]
Calmon, et al.; “Lists that are smaller than their parts: A coding approach to tunable secrecy;” Allerton 2012; arXiv:1210.2126v1 [cs.IT]; Oct. 8, 2012; 8 pages.
[cited by applicant]
Calmon, et al.; “Lists that are smaller than their parts: A coding approach to tunable secrecy;” Allerton 2012; RLE; Network Coding and Reliable Communications Group; Powerpoint Presentation; 46 pages.
[cited by applicant]
Calmon, et al.; “Network Coding Over Multiple Network Interfaces Using TCP;” Presentation; Information Theory and Applications Workshop (ITA) 2012; San Diego, CA; Feb. 5, 2012; 55 pages.
[cited by applicant]
Cardinal, et al.; “Minimum Entrophy Combinatorial Optimization Problems;” Data Structure and Algorithms, Discrete Mathematics; Aug. 17, 2010; pp. 1-16; 16 Pages.
[cited by applicant]
Castro, et al.; “Upper and Lower Error Bounds for Active Learning;” The 44'th Annual Allerton Conference on Communication, Control and Computing; vol. 2, No. 2.1; 2006, 10 Pages.
[cited by applicant]
Celik, et al.; “MAC for Networks with Multipacket Reception Capability and Spatially Distributed Nodes;” Proc. IEEE INFOCOM 2008; Apr. 2008; 9 Pages.
[cited by applicant]
Celik; “Distributed MAC Protocol for Networks with Multipacket Reception Capability and Spatially Distributed Nodes;” Master's Thesis; MIT Department of Electrical Engineering and Computer Science; May 2007; 127 Pages.
[cited by applicant]
Cha, et al.; “I Tube, You Tube, Everybody Tubes: Analyzing the World's Largest User Generated Content Video System;” 7
[cited by applicant]
Chakrabarti, et al.; “Approximation Algorithms for the Unsplittable Flow Problem;” Proceedings of the 5
[cited by applicant]
Chakrabarti, et al.; “Approximation Algorithms for the Unsplittable Flow Problem”; Algorithmica (2007); Springer Science—Business Media, Aug. 2006; 16 Pages.
[cited by applicant]
Charikar, et al.; “Approximation Algorithms for Directed Steiner Problems;” Proceedings of the 9
[cited by applicant]
Chen, et al.; “Pipeline Network Coding for Multicast Streams;” ICMU Org.; 2010; 7 Pages.
[cited by applicant]
Cheng et al.; “Partial Encryption of Compressed Images and Videos”; IEEE Transaction of Signal Processing; vol. 48, No. 8; Aug. 2000; 13 Pages.
[cited by applicant]
Chou, et al.; “FEC and Pseudo-ARQ for Receiver-driven Layered Multicast of Audio and Video;” Data Compression Conference (DCC), 2000; Proceedings; Jan. 2000; 10 Pages.
[cited by applicant]
Chou, et al.; “Practical Network Coding;” Proceedings of the 41
[cited by applicant]
Christiansen, et al.; “Brute force searching, the typical set and Guesswork;” Information Theory; arXiv: 1301.6356v1 [cs.IT]; Jan. 27, 2013; 5 Pages.
[cited by applicant]
Cisco Visual Networking Index: Forecast and Methodology; 2009-2014; White Paper; Jun. 2, 2010; 17 Pages.
[cited by applicant]
Cloud, et al.; “Co-Designing Multi-Packet Reception, Network Coding, and MAC Using a Simple Predictive Model;” arXiv:1101.5779v1 [cs.NI]; Submitted to W.Opt 2011; Jan. 30, 2011; 8 Pages.
[cited by applicant]
Cloud, et al.; “Effects of MAC approaches on non-monotonic saturation with COPE-a simple case study;” Military Communication Conference, 2011—MILCOM; Aug. 11, 2011; 7 Pages.
[cited by applicant]
Cloud, et al.; “MAC Centered Cooperation—Synergistic Design of Network Coding, Multi-Packet Reception, and Improved Fairness to Increase Network Throughput;” IEEE Journal on Selected Areas in Communications; vol. 30; No…
[cited by applicant]
Cloud, et al.; “Multi-Path TCP with Network Coding;” Wireless@mit—MIT Center for Wireless Networks and Mobile Computing; 2012 Inaugural Retreat; Oct. 10-11, 2012; 1 Page.
[cited by applicant]
Cloud, et al.; U.S. Appl. No. 13/654,953, filed Oct. 18, 2012; 34 Pages.
[cited by applicant]
Costa, et al.; “Informed Network Coding for Minimum Decoding Delay;” Fifth IEEE International Conference on Mobile Ad-hoc and Sensor Systems; Sep. 2008; pp. 80-91; 12 Pages.
[cited by applicant]
Coughlin, et al.; Years of Destiny: HDD Capital Spending and Technology Developments from 2012-2016; IEEE Santa Clara Valley Magnetics Society; Jun. 19, 2012; pp. 1-28; 28 Pages.
[cited by applicant]
Dana, et al.; “Capacity of Wireless Erasure Networks;” IEEE Transactions on Information Theory; vol. 52; No. 3; Mar. 2006; pp. 789-804; 16 Pages.
[cited by applicant]
Dana, et al.; “Capacity of Wireless Erasure Networks;” Jan. 2006; 41 pages.
[cited by applicant]
Deb, et al.; “Algebraic Gossip: A Network Coding Approach to Optimal Multiple Rumor Mongering;” Proc. Of the 42
[cited by applicant]
Deb, et al.; “On Random Network Coding Based Information Dissemination;” Proc. Of the IEEE International Symposium on Information Theory (ISIT); Sep. 4-9, 2005; 5 Pages.
[cited by applicant]
Demers, et al.; “Epidemic Algorithms for Replicated Database Maintenance;” PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing; Jan. 1987; pp. 1-12; 12 Pages.
[cited by applicant]
Dias, et al.; “Performance Analysis of HARQ in WiMax Networks Considering Imperfect Channel Estimation;” The 7
[cited by applicant]
Dimakis, et al.; “A Survey on Network Codes for Distributed Storage;” Proceedings of the IEEE; vol. 99; No. 3; Mar. 2011; pp. 476-489; 14 Pages.
[cited by applicant]
Dimakis, et al.; “Network Coding for Distributed Storage Systems;” IEEE/ACM Transactions on Information Theory; vol. 56; No. 9; pp. 1-13; 13 Pages.
[cited by applicant]
Donoho, et al.; “Estimating Covariances of Locally Stationary Processes: Rates of Convergence of Best Basis Methods;” Statistics, Stanford University, Stanford, California, USA, Tech. Rep; 1998; pp. 1-64; 64 Pages.
[cited by applicant]
Dougherty et al., “Maximum Distance Separable Codes in the p Metric over Arbitrary Alphabets;” Journal of Algebraic Combinatorics, vol. 16; 2002; pp. 71-81; 11 Pages.
[cited by applicant]
Effros; Distortion-Rate Bounds for Fixed-and Variable-Rate Multiresolution Source Codes; IEEE Transactions on Information Theory; vol. 45, No. 6; Sep. 1999; pp. 1887-1910; 24 Pages.
[cited by applicant]
Effros; “Universal Multiresolution Source Codes;” IEEE Transactions on Information Theory; vol. 47; No. 6; Sep. 2001; pp. 2113-2129; 17 Pages.
[cited by applicant]
El Bahri, et al.; “Performance Comparison of Type I, II and III Hybrid ARQ Schemes over AWGN Channels;” 2004 IEEE International Conference on Industrial Technology (ICIT); vol. 3; Dec. 8-10, 2004; pp. 1417-1421; 5 Pages.
[cited by applicant]
Elias; “List Decoding for Noisy Channels;” Research Laboratory of Electronics; MIT; Technical Report 335; Sep. 20, 1957; 14 Pages.
[cited by applicant]
Eryilmaz, et al.; On Delay Performance Gains From Network Coding; Information Sciences and Systems; 2006 40
[cited by applicant]
Eschenauer, et al.; “A Key-Management Scheme for Distributed Sensor Networks;” Proceedings in the 9
[cited by applicant]
El Rouyaheb et al.; “Secure Network Coding for Wiretap Networks of Type II”; arXiv:0907.3493v1 [cs.IT]; Jul. 20, 2009; 23 Pages.
[cited by applicant]
Karkpinski, et al.; “New Approximation Algorithms for the Steiner Tree Problems;” Technical Report, Electronic Colloquium on Computational Complexity (ECCC) TR95-030; 1995; pp. 1-17; 17 Pages.
[cited by applicant]
Karp, et al.; “Randomized Rumor Spreading;” IEEE Proceeding FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science; Jan. 2000; pp. 565-574; 10 Pages.
[cited by applicant]
Katti, et al.; “XORs in the Air: Practical Wireless Network Coding;” IEEE/ACM Transactions on Networking; vol. 16; No. 3; 2008; pp. 1-14; 14 Pages.
[cited by applicant]
Katti, et al.; “XORs in The Air: Practical Wireless Network Coding;” ACM SIGCOMM '06; Computer Communications Review; vol. 36; Sep. 11-15, 2006; 12 pages.
[cited by applicant]
Katz, et al.; “Introduction to Modern Cryptography;” Oct. 30, 2006; 327 pages.
[cited by applicant]
Kempe, et al.; “Protocols and Impossibility Results for Gossip-Based Communication Mechanisms;” Foundations of Computer Science, Jan. 2002; Proceedings. The 43
[cited by applicant]
Key, et al.; “Combining Multipath Routing and Congestion Control for Robustness;” In Proceedings of IEEE CISS, 2006, 6 Pages.
[cited by applicant]
Kim, et al.; “Modeling Network Coded TCP Throughout: A Simple Model and its Validation;” VALUETOOLS '11 Proceedings of the 5
[cited by applicant]
Kim, et al.; “Modeling Network Coded TCP Throughput: A Simple Model and its Validation”, Cornell University Library, http://arxiv.org/abs/1008.0420, Aug. 2010, 3 Pages.
[cited by applicant]
Kim, et al.; “Network Coding for Multi-Resolution Multicast;” IEEE INFOCOM 2010; Mar. 2010; 9 pages.
[cited by applicant]
Kim, et. al.; “Modeling Network Coded TCP Throughput: A Simple Model and its Validation”, arXiv: 1008.0420v1 [cs.IT] Aug. 2, 2010; 9 Pages.
[cited by applicant]
Kim, et al.; “Modeling Network Coded TCP Throughput: A Simple Model and its Validation”, Nov. 2010, Presentation; 19 Pages.
[cited by applicant]
Kodialam, et al.; “Online Multicast Routing With Bandwidth Guarantees: A New Approach Using Multicast Network Flow;” IEEE/ACM Transactions on Networking; vol. 11; No. 4; Aug. 2003; pp. 676-686; 11 Pages.
[cited by applicant]
Koetter, et al.; “An Algebraic Approach to Network Coding;” IEEE/ACM Transactions on Networking; vol. 11, No. 5; Oct. 2003; pp. 782-795; 14 Pages.
[cited by applicant]
Koetter, et al.; “Beyond Routing: An Algebraic Approach to Network Coding;” IEEE Infocom; 2002; 9 pages.
[cited by applicant]
Koutsonikolas, et al.; “Efficient Online WiFi Delivery of Layered-Coding Media using Inter-layer Network Coding;”Distributed Computing Systems (ICDCS); 2011 31
[cited by applicant]
Kritzner, et al.; “Priority Based Packet Scheduling with Tunable Reliability for Wireless Streaming;” Lecture Notes in Computer Science; 2004; pp. 707-717.
[cited by applicant]
Kuhn, et al.; “Distributed Computation in Dynamic Networks;” Proc. Of the 42
[cited by applicant]
Lai; “Sequential Analysis: Some Classical Problems and New Challenges”; Statistica Sinica, vol. 11, No. 2; 2001; pp. 303-350; 48 Pages.
[cited by applicant]
Landau; “Application of the Volterra Series to the Analysis and Design of an Angle Track Loop;” IEEE Transactions on Aerospace and Electronic Systems; vol. AES-8, No. 3; May 1972; pp. 306-318; 13 Pages.
[cited by applicant]
Larsson, et al.; “Analysis of Network Coded HARQ for Multiple Unicast Flows;” Communication (ICC) 2010 IEEE International Conference on May 23-27, 2010 pp. 1-6; 6 Pages.
[cited by applicant]
Larsson, et al.; “Multi-User ARQ;” Vehicular Technology Conference; 2006; VTC (2006-Spring); IEEE 63
[cited by applicant]
Larsson; “Analysis of Multi-User ARQ with Multiple Unicast Flows Under Non-iid Reception Probabilities;” Wireless Communication and Networking Conference 2007; WCNC 2007; IEEE; Mar. 11-15, 2007; pp. 384-388; 5 Pages.
[cited by applicant]
Larsson; “Multicast Multiuser ARQ;” Wireless Communications and Networking Conference (WCNC) 2008; IEEE; Apr. 3, 2008; pp. 1985-1990; 6 Pages.
[cited by applicant]
Le, et al.; “How Many Packets Can We Encode?—An Analysis of Practical Wireless Network Coding;” INFOCOM 2008; The 27
[cited by applicant]
Lee, et al.; “Content Distribution in VANETs using Network Coding: The Effect of Disk I/O and Processing O/H;” Proc. IEEE SECON; Jan. 2008; pp. 117-125; 9 Pages.
[cited by applicant]
Lehman, et al.; “Complexity Classification of Network Information Flow Problems;” SODA 04' Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms; Jan. 2004; pp. 9-10; 2 Pages.
[cited by applicant]
Li, et al.; “ Linear Network Coding;” IEEE Transactions on Information Theory; vol. 49; No. 2; Feb. 2003; pp. 371-381; 11 Pages.
[cited by applicant]
Li, et al.; “N-in-1 Retransmission with Network Coding;” IEEE Transactions on Wireless Communications; vol. 9; No. 9; Sep. 2010; pp. 2689-2694; 6 Pages.
[cited by applicant]
Li, et al.; “Robust and Flexible Scalable Video Multicast with Network Coding over P2P Network;” 2
[cited by applicant]
Lima, et al.; “An Information-Theoretic Cryptanalysis of Network Coding—is Protecting the Code Enough;” International Symposium on Information Theory and its Applications; Dec. 2008; 6 pages.
[cited by applicant]
Lima, et al.; “Random Linear Network Coding: A free cipher?;” IEEE International Symposium on Information Theory; Jun. 2007; pp. 546-550; 5 Pages.
[cited by applicant]
Lima, et al.; “Secure Network Coding for Multi-Resolution Wireless Video Streaming;” IEEE Journal on Selected Areas in Communications; vol. 28; No. 3; Apr. 2010; pp. 377-388 ; 12 Pages.
[cited by applicant]
Lima, et al.; “Towards Secure Multiresolution Network Coding;” IEEE Information Theory Workshop; Jun. 12, 2009; pp. 125-129; 5 Pages.
[cited by applicant]
Liu, et al.; “The Throughput Order of Ad Hoc Networks Employing Network Coding and Broadcasting;” Military Communications Conference; MILCOM 2006; Oct. 2006; pp. 1-7.
[cited by applicant]
Liu, et al.; “Using Layered Video to Provide Incentives in P2P Live Streaming;” P2P-TV07: Proceedings of the 2007 Workshop on Peer-to-peer Streaming and IP-TV; Aug. 31, 2007 ACM; 6 pages.
[cited by applicant]
Luby, et al.; “The Use of Forward Error Correction (FEC) in Reliable Multicast;” Internet Society Request for Comments; RFC 3453; Dec. 2002; 18 pages.
[cited by applicant]
Lucani et al.; “On Coding for Delay New Approaches based on Network Coding in Network Coding in Networks with Large Latency;” Presentation in NetCod; Slide Presentation; Jun. 16, 2009; 17 pages.
[cited by applicant]
Lucani et al.; “Broadcasting in Time-Division Duplexing: A Random Linear Network Coding Approach;” presented Switzerland; Conference: NetCod 2009, Lausanne, Switzerland; Jun. 2009; 6 pages.
[cited by applicant]
Lucani et al.; “On Coding for Delay—New Approaches Based on Network Coding in Networks with Large Latency;” Conference: ITA Workshop, San Diego, USA; Feb. 2009; 10 pages.
[cited by applicant]
Lucani et al.; “On Coding for Delay New Approaches based on Network Coding in Networks with Large Latency;” Conference ITA Workshop, San Diego, USA; Slide Presentation; Feb. 13, 2009; 11 pages.
[cited by applicant]
Lucani et al.; “Random Linear Network Coding For Time Division Duplexing: Energy Analysis;” Conference: ICC 2009, Dresden, Germany; Jun. 2009; 5 pages.
[cited by applicant]
Lucani et al.; “Random Linear Network Coding for Time-Division Duplexing: when to stop talking and start listening;” Presentation in INFOCOM; Slide Presentation; Apr. 23, 2009; 10 pages.
[cited by applicant]
Lucani et al.; “Random Linear Network Coding for Time-Division Duplexing: Queueing Analysis;” Conference ISIT 2009, Seoul, Korea; Jul. 2009; 5 Pages.
[cited by applicant]
Lucani et al.; “Random Linear Network Coding For Time-Division Duplexing: Field Size Considerations;” Conference: GLOBECOM 2009, Hawaii, USA; Dec. 2009; 6 Pages.
[cited by applicant]
Lucani, et al.; “Network Coding For Data Dissemination: It Is Not What You Know, But What Your Neighbors Don't Know;” Modeling and Optimization in Mobile, AdHoc, and Wireless Networks 2009; WiOPT 2009; 7
[cited by applicant]
Lucani, et al.; “Network Coding Schemes for Underwater Networks;” WUWNet 07; Sep. 14, 2007; pp. 25-32; 8 Pages.
[cited by applicant]
Lucani, et al.; “Systematic Network Coding for Time-Division Duplexing;” Proceedings of the IEEE International Symposium on Information Theory (ISIT); Jun. 13-18, 2010; pp. 2403-2407; 5 Pages.
[cited by applicant]
Lun, et al.; “Further Results on Coding for Reliable Communication over Packet Networks;” Information Theory, ISIT 2005 Proceedings International Symposium on Sep. 4-9, 2005; 5 pages.
[cited by applicant]
Lun, et al.; “On Coding for Reliable Communication Over Packet Networks;” Physical Communication; vol. 1; No. 1; Jan. 2008; pp. 10 pages.
[cited by applicant]
Lun, et al.; “On Coding for Reliable Communication over Packet Networks;” LIDS Publication #2741; Jan. 2007; 33 pages.
[cited by applicant]
Lun, et al.; An Analysis of Finite-Memory Random Linear Coding on Packet Streams; Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks; Apr. 3-6, 2006; pp. 1-6; 6 Pages.
[cited by applicant]
Lun; “Efficient Operation of Coded Packet Networks;” Ph.D. Dissertation; Massachusetts Institute of Technology; Jun. 2006; 130 pages.
[cited by applicant]
Magli, et al.; “An Overview of Network Coding for Multimedia Streaming;” IEEE International Conference; Jun. 28, 2009; pp. 1488-1491; 4 Pages.
[cited by applicant]
Mallat, et al.; “Adaptive Covariance Estimation of Locally Stationary Processes;” Annals of Statistics, vol. 26, No. 1; 1998; pp. 1-43; 43 Pages.
[cited by applicant]
Manssour, et al.; “A Unicast Retransmission Scheme based on Network Coding;” IEEE Transactions on Vehicular Technology; vol. 61; Issue 2; Nov. 2011; 7 pages.
[cited by applicant]
Mayer et al.; “A Survey of Security Issues in Multicast Communications”; IEEE Network; Nov./Dec. 1999; 12 Pages.
[cited by applicant]
Maymounkov, et al.; “Methods for Efficient Network Coding;” Proc. Of the 44
[cited by applicant]
Médard, et al.; “On Coding for Non-Multicast Networks;” invited paper, 41
[cited by applicant]
Medard; “Some New Directions for Network Coding in Content Distribution”, RLE, EECS, MIT, Seminar to Alcatel Lucent, Nov. 2010, 29 pages.
[cited by applicant]
Merchant, et al.; “Analytic Modeling of Clustered RAID with Mapping Based on Nearly Random Permutation;” IEEE Transactions on Computers; vol. 45; No. 3; Mar. 1996; pp. 367-373; 7 Pages.
[cited by applicant]
Metzner; “An Improved Broadcast Retransmission Protocol;” IEEE Transactions on Communications; vol. COM-32; No. 6; Jun. 1984; pp. 679-683; 5 Pages.
[cited by applicant]
Mills, et al.; “On Secure Communication Over Wireless Erasure Networks;” IEEE International Symposium on Information Theory; Jul. 2008; pp. 161-165; 5 Pages.
[cited by applicant]
Mosk-Aoyama, et al.; “Information Dissemination via Network Coding;” ISIT 2006; IEEE; Jul. 9-14, 2006; pp. 1748-1752; 5 Pages.
[cited by applicant]
Nguyen, et al.; “Internet Media Streaming Using Network Coding and Path Diversity;” IEEE Global Telecommunications Conference; Nov. 30-Dec. 4, 2008; 5 pages.
[cited by applicant]
Nguyen, et al.; “Wireless Broadcast Using Network Coding;” Vehicular Technology IEEE Transactions on Feb. 2009; vol. 58; Issue 2; 25 pages.
[cited by applicant]
Nguyen, et al.; “Video Streaming with Network Coding;” Journal of Signal Processing Systems; vol. 59, Issue 3; DOI: 10.1007/s11265-009-0342-7; Jun. 2010; 25 pages.
[cited by applicant]
Nobel; “Hypothesis Testing for Families of Ergodic Processes;” Bernoulli-London, vol. 12, No. 2; 2006; 21 pages.
[cited by applicant]
Noguichi, et al.; “Performance Evaluation of New Multicast Architecture with Network Coding;” IEICE Transactions on Communication, E86-B; No. 6; Jun. 2003; 3 pages.
[cited by applicant]
NS Version 1—LBNL Network Simulator; web page—http://ee.lel.gov/ns/; Mar. 21, 2011; 3 pages.
[cited by applicant]
Nyandoro, et al.; “Service Differentiation in Wireless LANs based on Capture;” IEEE GLOBECOM 2005; vol. 6; Dec. 2005; 5 pages.
[cited by applicant]
Oliveira, et al.; “A Network Coding Approach to Secret Key Distribution;” IEEE Transactions on Information Forensics and Security; vol. 3; No. 3; pp. 414-423; Sep. 2008; 10 Pages.
[cited by applicant]
Oliveira, et al.; “Trusted Storage Over Untrusted Networks;” IEEE Global Telecommunications Conference; Dec. 2010; pp. 1-5; 5 Pages.
[cited by applicant]
Ozarow, et al.; “Wire-Tap Channel II;” Advances in Cryptology; EUROCRYPT '84, LNCS 209; Jan. 1985; pp. 33-50; 18 Pages.
[cited by applicant]
ParandehGheibi, et al.; “Access-Network Association Policies for Media Streaming in Heterogeneous Environments;” Apr. 2010; pp. 1-8; 8 Pages.
[cited by applicant]
Peng, et al.; “Research on Network Coding based Hybrid-ARQ Scheme for Wireless Networks;” Communication Systems (ICCS); 2010 IEEE International Conference on Nov. 17-19, 2010; pp. 218-222; 5 Pages.
[cited by applicant]
Popovici, et al.; “Robust, Portable I/O Scheduling with the Disk Mimic;” Proc. USENIX Annual Tech. Conf. San Antonio, Texas, Jun. 2003; 14 pages.
[cited by applicant]
Qureshi, et al.; “An Efficient Network Coding based Retransmission Algorithm for Wireless Multicast;” Personal, Indoor and Mobile Radio Communications, 2009 IEEE 20
[cited by applicant]
Radunovic, et al.; “Horizon: Balancing TCP Over Multiple Paths in Wireless Mesh Network;” Proc. 14
[cited by applicant]
Ramanathan; “Multicast Tree Generation in Networks with Asymmetric Links;” IEEE Transactions on Networking; vol. 4; Aug. 1996; pp. 1-12; 12 Pages.
[cited by applicant]
Rezaee, et al.; “ Multi Packet Reception and Network Coding;” Presentation at The 2010 Military Communications Conference Unclassified Technical Program; Nov. 2, 2010; 15 pages.
[cited by applicant]
Rezaee, et al.; “An Analysis of Speeding Multicast by Acknowledgment Reduction Technique (SMART) with Homogeneous and Heterogeneous Links—A Method of Types Approach;” Signals, Systems and Computers (ASILOMAR) 2011 Confe…
[cited by applicant]
Rezaee, et al.; “Speeding Multicast by Acknowledgment Reduction Technique (SMART) Enabling Robustness of QoE to the Number of Users;” IEEE Journal on Selected Areas in Communication; vol. 30, No. 7; Aug. 2012; pp. 1270-…
[cited by applicant]
Rezaee, et.al.; “Multi Packet Reception and Network Coding;” Military Communications Conference; 2010; MILCOM 2010; IEEE; Oct. 31, 2010-Nov. 3, 2010; pp. 1393-1398; 6 Pages.
[cited by applicant]
Rezaee; “Network Coding, Multi-Packet Reception, and Feedback: Design Tools for Wireless Broadcast Networks;” Submitted to Department of Electrical Engineering and Computer Science at Massachusetts Institute of Technolo…
[cited by applicant]
Riemensberger, et al.; “Optimal Slotted Random Access in Coded Wireless Packet Networks;” WiOPt 10: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks; Jul. 13, 2010; pp. 374-379; 6 Pages.
[cited by applicant]
Roughgarden, et al.; “How Bad is Selfish Routing?” Journal of the ACM; vol. 49, No. 2; Mar. 2002; pp. 236-259; 24 Pages.
[cited by applicant]
Ruemmler, et al.; “An introduction to disk drive modeling;” IEEE Computers; vol. 27; No. 3; Mar. 17-29, 1994; 18 pages.
[cited by applicant]
Ryabko, et al.; “On Hypotheses Testing for Ergodic Processes;” Information Theory Workshop; ITW'08; IEEE; 2008; pp. 281-283; 3 Pages.
[cited by applicant]
Sanders, et al.; “Polynomial Time Algorithms for Network Information Flow;” 15
[cited by applicant]
Sayenko, et al.; “Performance Analysis of the IEEE 802.16 ARQ Mechanism;” MSWiM'07; Oct. 22-26, 2007; pp. 314-322; 9 Pages.
[cited by applicant]
Scharf; “MPTCP Application Interface Considerations draft-scharf-mptcp-ap-04;” Internet Engineering Task Force; Internet-Draft; Nov. 22, 2010; 26 pages.
[cited by applicant]
Seferoglu, et al.; “Opportunistic Network Coding for Video Streaming over Wireless;” Packet Video; Nov. 2007; 10 pages.
[cited by applicant]
Sengupta, et al.; “An Analysis of Wireless Network Coding for Unicast Sessions: The Case for Coding-Aware Routing;” in INFOCOM 2007; 26
[cited by applicant]
Servetto, et al.; “Constrained Random Walks on Random Graphs: Routing Algorithms for Large Scale Wireless Sensor Networks;” WSNA 02; Sep. 28, 2002; 10 pages.
[cited by applicant]
Shannon, et al.; “Lower Bounds to error Probability for Coding on Discrete Memoryless Channels, I;” Information and Control; vol. 10; No. 5; Feb. 1967; pp. 65-103; 39 Pages.
[cited by applicant]
Shannon, et al.; “Lower Bounds to error Probability for Coding on Discrete Memoryless Channels, II;” Information and Control; vol. 10; Issue 5; May 1967; pp. 522-552; 31 Pages.
[cited by applicant]
Shannon; “Communication Theory of Secrecy Systems;” Bell System Technical Journal; vol. 28; No. 4; pp. 656-715; Oct. 1949; 60 Pages.
[cited by applicant]
U.S. Appl. No. 13/890,604, filed May 9, 2013, Zeger, et al.
[cited by applicant]
U.S. Appl. No. 13/655,034, filed Oct. 18, 2012, Medard, et al.
[cited by applicant]
U.S. Appl. No. 13/654,953, filed Oct. 18, 2012, Zeger, et al.
[cited by applicant]
U.S. Appl. No. 14/208,683, filed Mar. 13, 2014, Calmon, et al.
[cited by applicant]
Feldman, et al.; “On the Capacity of Secure Network Coding;” Proc. 42
[cited by applicant]
Haeupler, et al.; “Optimality of Network Coding in Packet Networks;” ArXiv, Feb. 17, 2011; 5 pages.
[cited by applicant]
Haley, et al.; “Reversible Low-Density Parity-Check Codes;” IEEE Transactions on Information Theory; vol. 55; No. 5; May 2009; pp. 2016-2036; 21 Pages.
[cited by applicant]
ITU-T Telecommunication Standardization Sector of ITU; Series T: Terminals for Telematic Services Still-image compression—JPEG-1 extensions; Information Technology—Digital compression and coding of continuous-tone still…
[cited by applicant]
Kim, et al.; “Transform-free analysis of the GI/G/1/K queue through the decomposed Little's formula;” Computers and Operations Research; vol. 30; No. 3; Mar. 2003; pp. 1-20; 20 Pages.
[cited by applicant]
Lucani et al.; “Random Linear Network Coding for Time-Division Duplexing: when to stop talking and start listening;” Presentation in ICC; Slide Presentation; Jun. 16, 2009; 6 pages.
[cited by applicant]
Moyer, et al.; “A Survey of Security Issues in Multicast Communications;” IEEE Network; vol. 13; No. 6; Nov./Dec. 1999; pp. 12-23; 12 Pages.
[cited by applicant]
Rezaee, et al.; “Speeding Multicast by Acknowledgment Reduction Technique (SMART);” ArXiv:1104.2941v2 [cs.NI] Sep. 10, 2011; 6 pages.
[cited by applicant]
Shenker, et al.; “Pricing in computer networks: reshaping the research agenda;” Telecommunications Policy; vol. 20, No. 3; Jan. 1996; pp. 183-201; 19 Pages.
[cited by applicant]
Sherali, et al.; “Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs;” Elsevier Operations Research Letters 19 (Jan. 1996); pp. 105-113; 9 Pages.
[cited by applicant]
Shields; “The Interactions Between Ergodic Theory and Information Theory;” IEEE Transactions on Information Theory, vol. 44, No. 6; Oct. 1998; pp. 2079-2093; 15 Pages.
[cited by applicant]
Shrader, et al.; “Routing and Rate Control for Coded Cooperation in a Satellite-Terrestrial Network;” IEEE: The 2011 Military Communications Conference—Track 2—Network Protocols and Performance; Nov. 7-10, 2011; pp. 735…
[cited by applicant]
Shrader, et al.; “Systematic wireless network coding;” Military Conference, 2009; MILCOM 2009; IEEE; 7 pages.
[cited by applicant]
Shriver, et al.; “An analytic behavior model for disk drives with readahead caches and request reordering;” Proc. SIGMETRICS/Performance, Joint Conf. on Meas. and Modeling Comp. Sys.; ACM; Jan. 1998; 10 pages.
[cited by applicant]
Silva, et al.; “Universal Secure Network Coding via Rank-Metric Codes;” arXiv:0809.3546v2 [cs.IT]; Apr. 27, 2010; 12 pages.
[cited by applicant]
Song, et al.; “Zero-Error Network Coding for Acyclic Networks;” IEEE Transactions on Information Theory; vol. 49, No. 12; Dec. 2003; pp. 3129-3139; 11 Pages.
[cited by applicant]
SongPu, et al.; Performance analysis of joint chase combining and network coding in wireless broadcast retransmission; Wireless Communication, Network and Mobile Computing 2008; WiCOM '08, 4
[cited by applicant]
Soo Suh; “Send-On-Delta Sensor Data Transmission With A Linear Predictor;” Sensors; ISSN 1424-8220; vol. 7; No. 4; Apr. 26, 2007; pp. 537-547; 11 Pages.
[cited by applicant]
Sun, et al.; “Cooperative Hybrid-ARQ Protocol with Network Coding;” Communications and Networking in China 2009—ChinaCOM 2009; Fourth International Conference on Aug. 26-28, 2009; pp. 1-5; 5 Pages.
[cited by applicant]
Sundaram, et al.; “Multirate Media Streaming Using Network Coding;” Proc. 43
[cited by applicant]
Sundararajan, et al.; “ARQ for Network Coding;” ISIT Proc. Of the IEEE International Symposium on Information Theory (ISIT); Jul. 6-11, 2008; pp. 1651-1655; 5 Pages.
[cited by applicant]
Sundararajan, et al.; “Network Coding Meets TCP: Theory and Implementation;” Proceedings of the IEEE; vol. 99, Issue 3; Mar. 2011; pp. 490-512; 23 Pages.
[cited by applicant]
Sundararajan, et al.; “Network coding meets TCP;” InfoCOM 2009; IEEE, Apr. 19-25, 2009; pp. 280-288; 9 Pages.
[cited by applicant]
Sundararajan, et al.; “On Queueing in Coded Networks—Queue Size Follows Degrees of Freedom;” IEEE Information Theory Workshop on Information Theory for Wireless Networks (ITW); Jul. 1-6, 2007; 6 Pages.
[cited by applicant]
Teerapittayanon, et al.; “Network Coding as a WiMAX Link Reliability Mechanism;” Multiple Access Communication; Lectures Notes in Computer Science; vol. 7642; 2012; 12 Pages.
[cited by applicant]
Teerapittayanon, et al.; “Performance Enhancements in Next Generation Wireless Networks Using Network Coding: A Case Study in WiMAX;” Massachusetts Institute of Technology; Jun. 2012; 130 pages.
[cited by applicant]
Thobaben; “Joint Network/Channel Coding for Multi-User Hybrid-ARQ;” Source and Channel Coding (SCC) 2008; 7th International ITG Conference on Jan. 14-16, 2008; 6 pages.
[cited by applicant]
Tosun, et al.; “Efficient Multi-Layer Coding and Encryption of MPEG Video Streams;” Proc. 2000 IEEE International Conference on Multimedia and Expo; vol. 1; 2000; pp. 119-122; 4 Pages.
[cited by applicant]
Tosun, et al.; “Lightweight Security Mechanisms for Wireless Video Transmission;” Proc. Intl. Conference on Information Technology, Coding and Computing; Apr. 2001; pp. 157-161; 5 Pages.
[cited by applicant]
Tran, et al.; “A Hybrid Network Coding Technique for Single-Hop Wireless Networks;” IEEE Journal on Selected Areas in Communications; vol. 27; No. 5; Jun. 2009; pp. 685-698; 14 Pages.
[cited by applicant]
Tran, et al.; “A Joint Network-Channel Coding Technique for Single-Hop Wireless Networks;” Network Coding, Theory and Applications; 2008; NetCod 2008; Fourth Workshop on Jan. 3-4, 2008; 6 Pages.
[cited by applicant]
Trung, et al.; “Quality Enhancement for Motion JPEG Using Temporal Redundancies;” IEEE Transactions on Circuits and System for Video Technology, vol. 18; No. 5; May 2008; pp. 609-619.
[cited by applicant]
Tsatsanis, et al.; “Network Assisted Diversity for Random Access Wireless Data Networks;” Signals, Systems & amp; Computers; IEEE; vol. 1; Nov. 1-4, 1988; pp. 83-87; 5 Pages.
[cited by applicant]
Valancius, et al.; “Greening the Internet with Nano Data Centers;” Proc. 5
[cited by applicant]
Vasudevan, et al.; “Algebraic Gossip on Arbitrary Networks;” arXiv:0901.1444; Jan. 2009; 5 pages.
[cited by applicant]
Vellamhi, et al.; “Throughput and Latency in Finite-Buffer Line Networks;” IEEE Transactions on Information Theory; vol. 57; No. 6; Jun. 2011; pp. 3622-3643; 22 Pages.
[cited by applicant]
Vien, et al.; “Network Coding-based Block ACK for Wireless Relay Networks;” Proceedings of IEEE Vehicular Technology Conference (VTC2011-Spring); May 2011; 5 pages.
[cited by applicant]
Vien, et al.; “Network Coding-based ARQ Retransmission Strategies for Two-Way Wireless Relay Networks;” Software, Telecommunications and Computer Networks (SoftCOM) 2010; International Conference on Sep. 23-25, 2010; 5 …
[cited by applicant]
Vilela, et al.; “Lightweight Security for Network Coding;” IEEE International Conference on Communications; May 2008; 5 pages.
[cited by applicant]
Wachter-Zeh; “Bounds on List Decoding of Rank-Metric Codes;” Universite De Rennes 1; Powerpoint Presentation; Sep. 18, 2013; 46 pages.
[cited by applicant]
Wang et al.; “Guest Editorial Wireless Video Transmission”; IEEE Journal on Selected Areas in Communications; vol. 28, No. 3; Apr. 2010; pp. 297-298; 2 Pages.
[cited by applicant]
Cited By (1)