Information transmission over a finite buffer channel

Information transmission over a finite buffer channel. Diggavi, S N. & Grossglauser, M. IEEE Transactions on Information Theory, 52(3):1226–1237, March, 2006.
abstract bibtex

This paper was motivated by the transmission of information over finite buffer channels. Analyzing the capacity of such channels naturally led us to the study of \em deletion channels. In deletion channels, in contrast to erasure channels, symbols of the transmitted sequence are removed, and the receiver does \em not know which symbols have been deleted. This was a classic problem from the 1960s in the context of modeling synchronization errors. This paper gave the best known (at the time of publication) lower bounds to capacity of deletion channels since the 1960s. It also studied erasure channels with arbitrary memory in the erasure process. It showed that even when the erasure process has memory, feedback does not increase the capacity.

@article{DGj06,
 abstract = {This paper was motivated by the transmission of information over finite buffer
channels. Analyzing the capacity of such channels naturally led us to the study of {\em deletion} channels. In deletion channels, in contrast to erasure channels, symbols of the
transmitted sequence are removed, and the receiver does {\em not} know which symbols
have been deleted. This was a classic problem from the 1960s in the context of modeling
synchronization errors. This paper gave the best known (at the time of publication) 
lower bounds to capacity of deletion channels since the 1960s. It also studied erasure channels with arbitrary memory in the erasure process. It showed that even when the erasure
process has memory, feedback does not increase the capacity.},
 author = {S N. Diggavi and M. Grossglauser},
 file = {:papers:ps:finbuf.pdf},
 journal = {IEEE Transactions on Information Theory},
 label = {dg_j06},
 month = {March},
 note = {},
 number = {3},
 pages = {1226--1237},
 tags = {journal,DelChan,IT},
 title = {Information transmission over a finite buffer channel},
 type = {2},
 volume = {52},
 year = {2006}
}

Downloads: 0

{"_id":"YeYfzKtCCBzMFqmTk","bibbaseid":"diggavi-grossglauser-informationtransmissionoverafinitebufferchannel-2006","author_short":["Diggavi, S N.","Grossglauser, M."],"bibdata":{"bibtype":"article","type":"2","abstract":"This paper was motivated by the transmission of information over finite buffer channels. Analyzing the capacity of such channels naturally led us to the study of \\em deletion channels. In deletion channels, in contrast to erasure channels, symbols of the transmitted sequence are removed, and the receiver does \\em not know which symbols have been deleted. This was a classic problem from the 1960s in the context of modeling synchronization errors. This paper gave the best known (at the time of publication) lower bounds to capacity of deletion channels since the 1960s. It also studied erasure channels with arbitrary memory in the erasure process. It showed that even when the erasure process has memory, feedback does not increase the capacity.","author":[{"firstnames":["S","N."],"propositions":[],"lastnames":["Diggavi"],"suffixes":[]},{"firstnames":["M."],"propositions":[],"lastnames":["Grossglauser"],"suffixes":[]}],"file":":papers:ps:finbuf.pdf","journal":"IEEE Transactions on Information Theory","label":"dg_j06","month":"March","note":"","number":"3","pages":"1226–1237","tags":"journal,DelChan,IT","title":"Information transmission over a finite buffer channel","volume":"52","year":"2006","bibtex":"@article{DGj06,\n abstract = {This paper was motivated by the transmission of information over finite buffer\nchannels. Analyzing the capacity of such channels naturally led us to the study of {\\em deletion} channels. In deletion channels, in contrast to erasure channels, symbols of the\ntransmitted sequence are removed, and the receiver does {\\em not} know which symbols\nhave been deleted. This was a classic problem from the 1960s in the context of modeling\nsynchronization errors. This paper gave the best known (at the time of publication) \nlower bounds to capacity of deletion channels since the 1960s. It also studied erasure channels with arbitrary memory in the erasure process. It showed that even when the erasure\nprocess has memory, feedback does not increase the capacity.},\n author = {S N. Diggavi and M. Grossglauser},\n file = {:papers:ps:finbuf.pdf},\n journal = {IEEE Transactions on Information Theory},\n label = {dg_j06},\n month = {March},\n note = {},\n number = {3},\n pages = {1226--1237},\n tags = {journal,DelChan,IT},\n title = {Information transmission over a finite buffer channel},\n type = {2},\n volume = {52},\n year = {2006}\n}\n\n","author_short":["Diggavi, S N.","Grossglauser, M."],"key":"DGj06","id":"DGj06","bibbaseid":"diggavi-grossglauser-informationtransmissionoverafinitebufferchannel-2006","role":"author","urls":{},"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"https://bibbase.org/network/files/e2kjGxYgtBo8SWSbC","dataSources":["hicKnsKYNEFXC4CgH","jxCYzXXYRqw2fiEXQ","wCByFFrQMyRwfzrJ6","yuqM5ah4HMsTyDrMa","YaM87hGQiepg5qijZ","n9wmfkt5w8CPqCepg","soj2cS6PgG8NPmWGr","FaDBDiyFAJY5pL28h","ycfdiwWPzC2rE6H77"],"keywords":[],"search_terms":["information","transmission","over","finite","buffer","channel","diggavi","grossglauser"],"title":"Information transmission over a finite buffer channel","year":2006}