@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
}

{"_id":"MnD6N9ahtN5xq2owM","bibbaseid":"pfister-sason-urbanke-boundsonthedecodingcomplexityofpuncturedcodesongraphs-2004","author_short":["Pfister, H. D.","Sason, I.","Urbanke, R. L."],"bibdata":{"bibtype":"article","type":"article","added-at":"2018-08-13T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Pfister"],"firstnames":["Henry","D."],"suffixes":[]},{"propositions":[],"lastnames":["Sason"],"firstnames":["Igal"],"suffixes":[]},{"propositions":[],"lastnames":["Urbanke"],"firstnames":["Rüdiger","L."],"suffixes":[]}],"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","bibtex":"@article{journals/corr/cs-IT-0409027,\n added-at = {2018-08-13T00:00:00.000+0200},\n author = {Pfister, Henry D. and Sason, Igal and Urbanke, Rüdiger L.},\n biburl = {https://www.bibsonomy.org/bibtex/2301a8420c905f81cf0dc040e4c836709/dblp},\n ee = {http://arxiv.org/abs/cs.IT/0409027},\n interhash = {b90150915a7884915d471b0fe224a8e7},\n intrahash = {301a8420c905f81cf0dc040e4c836709},\n journal = {CoRR},\n keywords = {dblp},\n timestamp = {2018-08-14T12:33:09.000+0200},\n title = {Bounds on the decoding complexity of punctured codes on graphs},\n url = {http://dblp.uni-trier.de/db/journals/corr/corr0409.html#cs-IT-0409027},\n volume = {cs.IT/0409027},\n year = 2004\n}\n\n","author_short":["Pfister, H. D.","Sason, I.","Urbanke, R. L."],"key":"journals/corr/cs-IT-0409027","id":"journals/corr/cs-IT-0409027","bibbaseid":"pfister-sason-urbanke-boundsonthedecodingcomplexityofpuncturedcodesongraphs-2004","role":"author","urls":{"Link":"http://arxiv.org/abs/cs.IT/0409027","Paper":"http://dblp.uni-trier.de/db/journals/corr/corr0409.html#cs-IT-0409027"},"keyword":["dblp"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/pfister?items=1000","dataSources":["PGS2HXygFqa56tPwp"],"keywords":["dblp"],"search_terms":["bounds","decoding","complexity","punctured","codes","graphs","pfister","sason","urbanke"],"title":"Bounds on the decoding complexity of punctured codes on graphs","year":2004}