{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T10:55:09Z","timestamp":1772016909280,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540667230","type":"print"},{"value":"9783540467960","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46796-3_7","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T11:14:33Z","timestamp":1186053273000},"page":"65-76","source":"Crossref","is-referenced-by-count":78,"title":["New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity"],"prefix":"10.1007","author":[{"given":"M. Amin","family":"Shokrollahi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"1732","DOI":"10.1109\/18.556669","volume":"42","author":"N. Alon","year":"1996","unstructured":"N. Alon and M. Luby. A linear time erasure-resilient code with nearly optimal recovery.IEEE Trans. Inform. Theory, 42:1732\u20131736, 1996.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"7_CR2","volume-title":"Theory and Practice of Error Control Codes","author":"R.E. Blahut","year":"1983","unstructured":"R.E. Blahut. Theory and Practice of Error Control Codes. Addison Wesley, Reading, MA, 1983."},{"key":"7_CR3","unstructured":"P. Elias. Coding for two noisy channels. In Information Theory, Third London Symposium, pages 61\u201376, 1955."},{"key":"7_CR4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low Density Parity-Check Codes","author":"R. G. Gallager","year":"1963","unstructured":"R. G. Gallager. Low Density Parity-Check Codes. MIT Press, Cambridge, MA, 1963."},{"key":"7_CR5","unstructured":"R.L. Graham, D.E. Knuth, and P. Patashnik. Concrete Mathematics. Addison-Wesley, 1994."},{"key":"7_CR6","unstructured":"M. Luby, M. Mitzenmacher, and M.A. Shokrollahi. Analysis of random processes via and-or tree evaluation. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, page 364\u2013373, 1998."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"M. Luby, M. Mitzenmacher, M.A. Shokrollahi, and D. Spielman. Analysis of low density codes and improved designs using irregular graphs. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 249\u2013258, 1998.","DOI":"10.1145\/276698.276756"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"M. Luby, M. Mitzenmacher, M.A. Shokrollahi, D. Spielman, and V. Stemann. Practical loss-resilient codes. In Proceedings of the 29th annual ACM Symposium on Theory of Computing, pages 150\u2013159, 1997.","DOI":"10.1145\/258533.258573"},{"key":"7_CR9","unstructured":"M. Luby and M.A. Shokrollahi. Right regular erasure codes. Unpublished, 1998."},{"key":"7_CR10","unstructured":"F.J. MacWilliams and N.J.A. Sloane. The Theory of Error-Correcting Codes. North-Holland, 1988."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46796-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T17:29:39Z","timestamp":1556731779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46796-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667230","9783540467960"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-46796-3_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}