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.
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
{"_id":"adsdGDE9WD37oBFBh","bibbaseid":"barak-burshtein-feder-boundsonachievableratesofldpccodesusedoverthebinaryerasurechannel-2004","author_short":["Barak, O.","Burshtein, D.","Feder, M."],"bibdata":{"bibtype":"article","type":"article","added-at":"2020-03-10T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Barak"],"firstnames":["Ohad"],"suffixes":[]},{"propositions":[],"lastnames":["Burshtein"],"firstnames":["David"],"suffixes":[]},{"propositions":[],"lastnames":["Feder"],"firstnames":["Meir"],"suffixes":[]}],"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","bibtex":"@article{journals/tit/BarakBF04,\n added-at = {2020-03-10T00:00:00.000+0100},\n author = {Barak, Ohad and Burshtein, David and Feder, Meir},\n biburl = {https://www.bibsonomy.org/bibtex/26b16cf7b209e70e5a7c42dbac1361feb/dblp},\n ee = {https://doi.org/10.1109/TIT.2004.834845},\n interhash = {cb942e6d739fec71acc80837f2eec2b1},\n intrahash = {6b16cf7b209e70e5a7c42dbac1361feb},\n journal = {IEEE Trans. Inf. Theory},\n keywords = {dblp},\n number = 10,\n pages = {2483-2492},\n timestamp = {2020-03-11T11:58:55.000+0100},\n title = {Bounds on achievable rates of LDPC codes used over the binary erasure channel.},\n url = {http://dblp.uni-trier.de/db/journals/tit/tit50.html#BarakBF04},\n volume = 50,\n year = 2004\n}\n\n","author_short":["Barak, O.","Burshtein, D.","Feder, M."],"key":"journals/tit/BarakBF04","id":"journals/tit/BarakBF04","bibbaseid":"barak-burshtein-feder-boundsonachievableratesofldpccodesusedoverthebinaryerasurechannel-2004","role":"author","urls":{"Link":"https://doi.org/10.1109/TIT.2004.834845","Paper":"http://dblp.uni-trier.de/db/journals/tit/tit50.html#BarakBF04"},"keyword":["dblp"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/barak ?items=1000","dataSources":["sNDcqxpX5cBQ5Pu7G"],"keywords":["dblp"],"search_terms":["bounds","achievable","rates","ldpc","codes","used","over","binary","erasure","channel","barak","burshtein","feder"],"title":"Bounds on achievable rates of LDPC codes used over the binary erasure channel.","year":2004}