10.9k citations
- University of OklahomaUS1.3k papers
- University of ChicagoUS1.3k papers
- Southern Methodist UniversityUS1.3k papers
- University of Illinois Urbana-ChampaignUS1.3k papers
- McGill UniversityCA1.3k papers
- The Ohio State UniversityUS1.3k papers
- University of PittsburghUS1.3k papers
- University of British ColumbiaCA1.2k papers
- Rutherford Appleton LaboratoryGB1.2k papers
- European Organization for Nuclear ResearchCH1.2k papers
- University of AlbertaCA1.2k papers
- University of OxfordGB1.2k papers
Showing 2012 · cs.ITShow all
3 papers · 2 filters
cs.IT2012
Analysis and Design of Irregular Graphs for Node-Based Verification-Based Recovery Algorithms in Compressed Sensing
Yaser Eftekhari, Amir H. Banihashemi, Ioannis Lambadaris
In this paper, we present a probabilistic analysis of iterative node-based verification-based (NB-VB) recovery algorithms over irregular graphs in the context of compressed sensing…
cs.IT2012★ 1 cited
Coding Delay Analysis of Chunked Codes over Line Networks
Anoosheh Heidarzadeh, Amir H. Banihashemi
In this paper, we analyze the coding delay and the average coding delay of Chunked network Codes (CC) over line networks with Bernoulli losses and deterministic regular or Poisson…
cs.IT2012★ 1 cited
How Fast Can Dense Codes Achieve the Min-Cut Capacity of Line Networks?
Anoosheh Heidarzadeh, Amir H. Banihashemi
In this paper, we study the coding delay and the average coding delay of random linear network codes (dense codes) over line networks with deterministic regular and Poisson transmi…