@conference {758535,
	title = {New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity},
	booktitle = {AAECC-13: Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes},
	year = {1999},
	pages = {65{\textendash}76},
	publisher = {Springer-Verlag},
	organization = {Springer-Verlag},
	address = {London, UK},
	abstract = {We will introduce a new class of erasure codes built from irregular bipartite graphs that have linear time encoding and decoding algorithms and can transmit over an erasure channel at rates arbitrarily close to the channel capacity. We also show that these codes are close to optimal with respect to the trade-off between the proximity to the channel capacity and the running time of the recovery algorithm.},
	keywords = {coding theory, irregular bipartite graphs, recovery algorithm},
	isbn = {3-540-66723-7},
	url = {http://portal.acm.org/citation.cfm?id=758535\&dl=GUIDE\&coll=GUIDE\&CFID=102355791\&CFTOKEN=32605420$\#$},
	author = {M. Amin Shokrollahi}
}

{"_id":"A856RhJ3jJTz5R3ke","bibbaseid":"shokrollahi-newsequencesoflineartimeerasurecodesapproachingthechannelcapacity-1999","downloads":0,"creationDate":"2018-07-03T04:50:27.192Z","title":"New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity","author_short":["Shokrollahi, M. A."],"year":1999,"bibtype":"conference","biburl":"https://gnunet.org/bibliography/export/bibtex","bibdata":{"bibtype":"conference","type":"conference","title":"New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity","booktitle":"AAECC-13: Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","year":"1999","pages":"65\\textendash76","publisher":"Springer-Verlag","organization":"Springer-Verlag","address":"London, UK","abstract":"We will introduce a new class of erasure codes built from irregular bipartite graphs that have linear time encoding and decoding algorithms and can transmit over an erasure channel at rates arbitrarily close to the channel capacity. We also show that these codes are close to optimal with respect to the trade-off between the proximity to the channel capacity and the running time of the recovery algorithm.","keywords":"coding theory, irregular bipartite graphs, recovery algorithm","isbn":"3-540-66723-7","url":"http://portal.acm.org/citation.cfm?id=758535&dl=GUIDE&coll=GUIDE&CFID=102355791&CFTOKEN=32605420$#$","author":[{"firstnames":["M.","Amin"],"propositions":[],"lastnames":["Shokrollahi"],"suffixes":[]}],"bibtex":"@conference {758535,\n\ttitle = {New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity},\n\tbooktitle = {AAECC-13: Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes},\n\tyear = {1999},\n\tpages = {65{\\textendash}76},\n\tpublisher = {Springer-Verlag},\n\torganization = {Springer-Verlag},\n\taddress = {London, UK},\n\tabstract = {We will introduce a new class of erasure codes built from irregular bipartite graphs that have linear time encoding and decoding algorithms and can transmit over an erasure channel at rates arbitrarily close to the channel capacity. We also show that these codes are close to optimal with respect to the trade-off between the proximity to the channel capacity and the running time of the recovery algorithm.},\n\tkeywords = {coding theory, irregular bipartite graphs, recovery algorithm},\n\tisbn = {3-540-66723-7},\n\turl = {http://portal.acm.org/citation.cfm?id=758535\\&dl=GUIDE\\&coll=GUIDE\\&CFID=102355791\\&CFTOKEN=32605420$\\#$},\n\tauthor = {M. Amin Shokrollahi}\n}\n","author_short":["Shokrollahi, M. A."],"key":"758535","id":"758535","bibbaseid":"shokrollahi-newsequencesoflineartimeerasurecodesapproachingthechannelcapacity-1999","role":"author","urls":{"Paper":"http://portal.acm.org/citation.cfm?id=758535&dl=GUIDE&coll=GUIDE&CFID=102355791&CFTOKEN=32605420$#$"},"keyword":["coding theory","irregular bipartite graphs","recovery algorithm"],"downloads":0},"search_terms":["new","sequences","linear","time","erasure","codes","approaching","channel","capacity","shokrollahi"],"keywords":["coding theory","irregular bipartite graphs","recovery algorithm"],"authorIDs":[],"dataSources":["FWsPTwsmjtrBtRS3B"]}