Bounds on the decoding complexity of punctured codes on graphs. Pfister, H. D., Sason, I., & Urbanke, R. L. CoRR, 2004.
Bounds on the decoding complexity of punctured codes on graphs [link]Link  Bounds on the decoding complexity of punctured codes on graphs [link]Paper  bibtex   
@article{journals/corr/cs-IT-0409027,
  added-at = {2018-08-13T00:00:00.000+0200},
  author = {Pfister, Henry D. and Sason, Igal and Urbanke, Rüdiger L.},
  biburl = {https://www.bibsonomy.org/bibtex/2301a8420c905f81cf0dc040e4c836709/dblp},
  ee = {http://arxiv.org/abs/cs.IT/0409027},
  interhash = {b90150915a7884915d471b0fe224a8e7},
  intrahash = {301a8420c905f81cf0dc040e4c836709},
  journal = {CoRR},
  keywords = {dblp},
  timestamp = {2018-08-14T12:33:09.000+0200},
  title = {Bounds on the decoding complexity of punctured codes on graphs},
  url = {http://dblp.uni-trier.de/db/journals/corr/corr0409.html#cs-IT-0409027},
  volume = {cs.IT/0409027},
  year = 2004
}

Downloads: 0