@inproceedings{DGj01,
 abstract = {This paper develops the best known (at the time of publication) capacity lower
bounds to the deletion channel since the 1960s. It also makes a connection between deletion
channels and the well studied problem of the length of the longest common subsequence.
It shows that the capacity of the deletion channel for large alphabet size is close to the
corresponding erasure channel, though the coding schemes for the two channels are 
drastically different.},
 author = {S N. Diggavi and M.Grossglauser},
 booktitle = {Allerton Conference on Communication, Control, and Computing, Illinois},
 file = {:papers:ps:allerton01.pdf},
 month = {October},
 note = {},
 pages = {},
 tags = {conf,DelChan,IT,SelConf},
 title = {On transmission over deletion channels},
 type = {4},
 year = {2001}
}

{"_id":"GPFbXtqjwHtx76CL7","bibbaseid":"diggavi-mgrossglauser-ontransmissionoverdeletionchannels-2001","author_short":["Diggavi, S N.","M.Grossglauser"],"bibdata":{"bibtype":"inproceedings","type":"4","abstract":"This paper develops the best known (at the time of publication) capacity lower bounds to the deletion channel since the 1960s. It also makes a connection between deletion channels and the well studied problem of the length of the longest common subsequence. It shows that the capacity of the deletion channel for large alphabet size is close to the corresponding erasure channel, though the coding schemes for the two channels are drastically different.","author":[{"firstnames":["S","N."],"propositions":[],"lastnames":["Diggavi"],"suffixes":[]},{"firstnames":[],"propositions":[],"lastnames":["M.Grossglauser"],"suffixes":[]}],"booktitle":"Allerton Conference on Communication, Control, and Computing, Illinois","file":":papers:ps:allerton01.pdf","month":"October","note":"","pages":"","tags":"conf,DelChan,IT,SelConf","title":"On transmission over deletion channels","year":"2001","bibtex":"@inproceedings{DGj01,\n abstract = {This paper develops the best known (at the time of publication) capacity lower\nbounds to the deletion channel since the 1960s. It also makes a connection between deletion\nchannels and the well studied problem of the length of the longest common subsequence.\nIt shows that the capacity of the deletion channel for large alphabet size is close to the\ncorresponding erasure channel, though the coding schemes for the two channels are \ndrastically different.},\n author = {S N. Diggavi and M.Grossglauser},\n booktitle = {Allerton Conference on Communication, Control, and Computing, Illinois},\n file = {:papers:ps:allerton01.pdf},\n month = {October},\n note = {},\n pages = {},\n tags = {conf,DelChan,IT,SelConf},\n title = {On transmission over deletion channels},\n type = {4},\n year = {2001}\n}\n\n","author_short":["Diggavi, S N.","M.Grossglauser"],"key":"DGj01","id":"DGj01","bibbaseid":"diggavi-mgrossglauser-ontransmissionoverdeletionchannels-2001","role":"author","urls":{},"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"https://bibbase.org/network/files/e2kjGxYgtBo8SWSbC","dataSources":["hicKnsKYNEFXC4CgH","jxCYzXXYRqw2fiEXQ","wCByFFrQMyRwfzrJ6","yuqM5ah4HMsTyDrMa","YaM87hGQiepg5qijZ","n9wmfkt5w8CPqCepg","soj2cS6PgG8NPmWGr","FaDBDiyFAJY5pL28h","ycfdiwWPzC2rE6H77"],"keywords":[],"search_terms":["transmission","over","deletion","channels","diggavi","m.grossglauser"],"title":"On transmission over deletion channels","year":2001}