On Minimizing Decoding Complexity for Binary Linear Network Codes
- 7 May 2019
- book chapter
- Published by Springer Nature
- p. 576-586
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Pseudo-Systematic Decoding of Hybrid Instantly Decodable Network Code for Wireless BroadcastingIEEE Wireless Communications Letters, 2018
- Linear Network Coding for Erasure Broadcast Channel With Feedback: Complexity and AlgorithmsIEEE Transactions on Information Theory, 2016
- Analysis and Optimization of Sparse Random Linear Network Coding for Reliable Multicast ServicesIEEE Transactions on Communications, 2015
- Tunable sparse network coding for multicast networks2014
- Decoding Algorithms for Random Linear Network Codes2011
- A Random Linear Network Coding Approach to MulticastIEEE Transactions on Information Theory, 2006
- Raptor codesIEEE Transactions on Information Theory, 2006
- Linear network codingIEEE Transactions on Information Theory, 2003
- Solving linear equations over GF(2): block Lanczos algorithmLinear Algebra and its Applications, 1993
- On wiedemann's method of solving sparse linear systems1991