89 citations · 242 across the 34 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.IT2013★ 10 cited
Linear-Complexity Overhead-Optimized Random Linear Network Codes
Kaveh Mahdaviani, Raman Yazdani, Masoud Ardakani
Sparse random linear network coding (SRLNC) is an attractive technique proposed in the literature to reduce the decoding complexity of random linear network coding. Recognizing the…
cs.IT2013★ 16 cited
Overhead-Optimized Gamma Network Codes
Kaveh Mahdaviani, Raman Yazdani, Masoud Ardakani
We design a network coding scheme with minimum reception overhead and linear encoding/decoding complexity.