2010 · 76 citations · 5 references
ComputingCommunicationComputer ScienceComputer NetworksDigital CommunicationDistributed SystemsChannel CapacityChannel CodingCoding TheoryCommunication NetworksNetwork Information TheoryNetwork Performance AnalysisComputational EfficiencyComputational Efficiency AnalysisDecoding ComplexityEncoding And DecodingMessage LengthNetwork CapacityNetwork CodingRandom Linear Codes
Network coding is known to improve the throughput and the resilience to losses in most network scenarios. In a practical network scenario, however, the accurate modeling of the traffic is often too complex and/or infeasible. The goal is thus to design codes that perform close to the capacity of any network (with arbitrary traffic) efficiently. In this context, random linear network codes are known to be capacity-achieving while requiring a decoding complexity quadratic in the message length. Chunked Codes (CC) were proposed by Maymounkov et al. to improve the computational efficiency of random codes by partitioning the message into a number of non-overlapping chunks. CC can also be capacity-achieving but have a lower encoding/decoding complexity at the expense of slower convergence to the capacity. In this paper, we propose and analyze a generalized version of CC called Overlapped Chunked Codes (OCC) in which chunks are allowed to overlap. Our theoretical analysis and simulation results show that compared to CC, OCC can achieve the capacity with a faster speed while maintaining almost the same advantage in computational efficiency.
5
How Practical is Network Coding?
Mea Wang, Baochun Li · International Workshop on Quality of Service · 2006 · 1.4K citations
On coding for reliable communication over packet networks
Desmond S. Lun, Muriel Médard, R. Koetter et al. · Physical Communication · 2008 · 583 citations · Full text
Sparse network coding with overlapping classes
Danilo Silva, Weifei Zeng, Frank R. Kschischang · 2009 · 104 citations · Full text
Random Matrices and Codes for the Erasure Channel
Chris Studholme, Ian F. Blake · Algorithmica · 2008 · 39 citations