Kovalenko's Full-Rank Limit and Overhead as Lower Bounds for Error-Performances of LDPC and LT Codes over Binary Erasure Channels

Computer Science – Information Theory

Scientific paper


  [ 0.00 ] – not rated yet Voters 0   Comments 0

Please leave your Comment & Rating

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.