BibTeX record journals/corr/cs-IT-0409027

download as .bib file

@article{DBLP:journals/corr/cs-IT-0409027,
  author       = {Henry D. Pfister and
                  Igal Sason and
                  R{\"{u}}diger L. Urbanke},
  title        = {Bounds on the decoding complexity of punctured codes on graphs},
  journal      = {CoRR},
  volume       = {cs.IT/0409027},
  year         = {2004},
  url          = {http://arxiv.org/abs/cs.IT/0409027},
  timestamp    = {Mon, 13 Aug 2018 16:49:04 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/cs-IT-0409027.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.