41 citations · 67 across the 4 of their papers we have counts for
5 papers
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…
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.
Reliable communication over non-binary insertion/deletion channels
Raman Yazdani, Masoud Ardakani
We consider the problem of reliable communication over non-binary insertion/deletion channels where symbols are randomly deleted from or inserted in the transmitted sequence and al…
Efficient LLR Calculation for Non-Binary Modulations over Fading Channels
Raman Yazdani, Masoud Ardakani
Log-likelihood ratio (LLR) computation for non-binary modulations over fading channels is complicated. A measure of LLR accuracy on asymmetric binary channels is introduced to faci…
Optimum Linear LLR Calculation for Iterative Decoding on Fading Channels
Raman Yazdani, Masoud Ardakani
On a fading channel with no channel state information at the receiver, calculating true log-likelihood ratios (LLR) is complicated. Existing work assume that the power of the addit…