Bounds on achievable rates of LDPC codes used over the binary erasure channel. Barak, O., Burshtein, D., & Feder, M. IEEE Trans. Inf. Theory, 50(10):2483-2492, 2004.
Bounds on achievable rates of LDPC codes used over the binary erasure channel. [link]Link  Bounds on achievable rates of LDPC codes used over the binary erasure channel. [link]Paper  bibtex   
@article{journals/tit/BarakBF04,
  added-at = {2020-03-10T00:00:00.000+0100},
  author = {Barak, Ohad and Burshtein, David and Feder, Meir},
  biburl = {https://www.bibsonomy.org/bibtex/26b16cf7b209e70e5a7c42dbac1361feb/dblp},
  ee = {https://doi.org/10.1109/TIT.2004.834845},
  interhash = {cb942e6d739fec71acc80837f2eec2b1},
  intrahash = {6b16cf7b209e70e5a7c42dbac1361feb},
  journal = {IEEE Trans. Inf. Theory},
  keywords = {dblp},
  number = 10,
  pages = {2483-2492},
  timestamp = {2020-03-11T11:58:55.000+0100},
  title = {Bounds on achievable rates of LDPC codes used over the binary erasure channel.},
  url = {http://dblp.uni-trier.de/db/journals/tit/tit50.html#BarakBF04},
  volume = 50,
  year = 2004
}

Downloads: 0