@inproceedings{DMPj07,
 abstract = {We present upper bounds on the capacity of the i.i.d.
binary deletion channel, where each bit is independently deleted
with a fixed probability d. We provide a general approach that
gives a numerical answer for fixed d, and provide an argument
that gives asymptotic upper bounds as d goes to 1. These appear
to be the first non-trivial upper bounds for this probabilistic
deletion channel.},
 author = {S N. Diggavi and M. Mitzenmacher and H D. Pfister},
 booktitle = {IEEE International Symposium on Information Theory (ISIT), Nice,France},
 file = {:papers:delubisit07.pdf},
 month = {June},
 note = {},
 pages = {1716--1720},
 tags = {conf,DelChan,IT,SelConf},
 title = {Capacity upper bounds for the deletion channel},
 type = {4},
 year = {2007}
}

{"_id":"oZSC2wpFuT9oDEaqu","bibbaseid":"diggavi-mitzenmacher-pfister-capacityupperboundsforthedeletionchannel-2007","author_short":["Diggavi, S N.","Mitzenmacher, M.","Pfister, H D."],"bibdata":{"bibtype":"inproceedings","type":"4","abstract":"We present upper bounds on the capacity of the i.i.d. binary deletion channel, where each bit is independently deleted with a fixed probability d. We provide a general approach that gives a numerical answer for fixed d, and provide an argument that gives asymptotic upper bounds as d goes to 1. These appear to be the first non-trivial upper bounds for this probabilistic deletion channel.","author":[{"firstnames":["S","N."],"propositions":[],"lastnames":["Diggavi"],"suffixes":[]},{"firstnames":["M."],"propositions":[],"lastnames":["Mitzenmacher"],"suffixes":[]},{"firstnames":["H","D."],"propositions":[],"lastnames":["Pfister"],"suffixes":[]}],"booktitle":"IEEE International Symposium on Information Theory (ISIT), Nice,France","file":":papers:delubisit07.pdf","month":"June","note":"","pages":"1716–1720","tags":"conf,DelChan,IT,SelConf","title":"Capacity upper bounds for the deletion channel","year":"2007","bibtex":"@inproceedings{DMPj07,\n abstract = {We present upper bounds on the capacity of the i.i.d.\nbinary deletion channel, where each bit is independently deleted\nwith a fixed probability d. We provide a general approach that\ngives a numerical answer for fixed d, and provide an argument\nthat gives asymptotic upper bounds as d goes to 1. These appear\nto be the first non-trivial upper bounds for this probabilistic\ndeletion channel.},\n author = {S N. Diggavi and M. Mitzenmacher and H D. Pfister},\n booktitle = {IEEE International Symposium on Information Theory (ISIT), Nice,France},\n file = {:papers:delubisit07.pdf},\n month = {June},\n note = {},\n pages = {1716--1720},\n tags = {conf,DelChan,IT,SelConf},\n title = {Capacity upper bounds for the deletion channel},\n type = {4},\n year = {2007}\n}\n\n","author_short":["Diggavi, S N.","Mitzenmacher, M.","Pfister, H D."],"key":"DMPj07","id":"DMPj07","bibbaseid":"diggavi-mitzenmacher-pfister-capacityupperboundsforthedeletionchannel-2007","role":"author","urls":{},"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"https://bibbase.org/network/files/e2kjGxYgtBo8SWSbC","dataSources":["PGS2HXygFqa56tPwp","hicKnsKYNEFXC4CgH","jxCYzXXYRqw2fiEXQ","wCByFFrQMyRwfzrJ6","yuqM5ah4HMsTyDrMa","YaM87hGQiepg5qijZ","n9wmfkt5w8CPqCepg","soj2cS6PgG8NPmWGr","FaDBDiyFAJY5pL28h","ycfdiwWPzC2rE6H77"],"keywords":[],"search_terms":["capacity","upper","bounds","deletion","channel","diggavi","mitzenmacher","pfister"],"title":"Capacity upper bounds for the deletion channel","year":2007}