{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T03:24:17Z","timestamp":1649215457205},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T00:00:00Z","timestamp":1288656000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10623-010-9445-1","type":"journal-article","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T14:54:49Z","timestamp":1288709689000},"page":"151-166","source":"Crossref","is-referenced-by-count":0,"title":["List decodability at small radii"],"prefix":"10.1007","volume":"61","author":[{"given":"Yeow Meng","family":"Chee","sequence":"first","affiliation":[]},{"given":"Gennian","family":"Ge","sequence":"additional","affiliation":[]},{"given":"Lijun","family":"Ji","sequence":"additional","affiliation":[]},{"given":"San","family":"Ling","sequence":"additional","affiliation":[]},{"given":"Jianxing","family":"Yin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,2]]},"reference":[{"issue":"4","key":"9445_CR1","doi-asserted-by":"crossref","first-page":"824","DOI":"10.2307\/3212384","volume":"10","author":"R. Ahlswede","year":"1973","unstructured":"Ahlswede R.: Channel capacities for list codes. J. Appl. Probab. 10(4), 824\u2013836 (1973)","journal-title":"J. Appl. Probab."},{"issue":"vyp. 4","key":"9445_CR2","first-page":"41","volume":"1","author":"L.A. Bassalygo","year":"1965","unstructured":"Bassalygo L.A.: New upper bounds for error-correcting codes. Problemy Pereda\u010di Informacii 1(vyp. 4), 41\u201344 (1965)","journal-title":"Problemy Pereda\u010di Informacii"},{"issue":"1","key":"9445_CR3","first-page":"7","volume":"22","author":"V. Blinovsky","year":"1986","unstructured":"Blinovsky V.: Bounds for codes in the case of list decoding of finite volume. Probl. Inform. Transm. 22(1), 7\u201319 (1986)","journal-title":"Probl. Inform. Transm."},{"key":"9445_CR4","doi-asserted-by":"crossref","unstructured":"Blinovsky V.: Asymptotic Combinatorial Coding Theory. The Kluwer International Series in Engineering and Computer Science, 415. Kluwer Academic Publishers, Boston (1997).","DOI":"10.1007\/978-1-4615-6193-4"},{"key":"9445_CR5","first-page":"3","volume":"5","author":"A.E. Brouwer","year":"1978","unstructured":"Brouwer A.E.: On the packing of quadruples without common triples. Ars Combin. 5, 3\u20136 (1978)","journal-title":"Ars Combin."},{"issue":"3","key":"9445_CR6","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0097-3165(79)90105-5","volume":"26","author":"A.E. Brouwer","year":"1979","unstructured":"Brouwer A.E.: Optimal packings of K 4\u2019s into a K n . J. Comb. Theory A 26(3), 278\u2013297 (1979)","journal-title":"J. Comb. Theory A"},{"issue":"6","key":"9445_CR7","doi-asserted-by":"crossref","first-page":"1334","DOI":"10.1109\/18.59932","volume":"36","author":"A.E. Brouwer","year":"1990","unstructured":"Brouwer A.E., Shearer J.B., Sloane N.J.A., Smith W.D.: A new table of constant weight codes. IEEE Trans. Inform. Theory 36(6), 1334\u20131380 (1990)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9445_CR8","unstructured":"Cassuto Y., Bruck J.: A combinatorial bound on the list size. Technical Report, California Institute of Technology, Pasedna, CA (2004)."},{"key":"9445_CR9","unstructured":"Elias P.: List decoding for noisy channels. Technical report 335. Research Laboratory of Electronics, Massachusetts Institute of Technology (1957)."},{"issue":"1","key":"9445_CR10","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/18.61123","volume":"37","author":"P. Elias","year":"1991","unstructured":"Elias P.: Error-correcting codes for list decoding. IEEE Trans. Inform. Theory 37(1), 5\u201312 (1991)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9445_CR11","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1109\/TIT.1968.1054184","volume":"14","author":"G.D. Forney","year":"1968","unstructured":"Forney G.D.: Exponential error bounds for erasure, list and decision feedback schemes. IEEE Trans. Inform. Theory 14, 549\u2013557 (1968)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9445_CR12","unstructured":"Goldreich O., Levin L.A.: A hard-core predicate for all one-way functions. In: STOC 1989: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 15\u201317 May 1989, Seattle, Washington, USA, pp. 25\u201332. ACM Press (1989)."},{"key":"9445_CR13","unstructured":"Guruswami V.: List Decoding of Error-Correcting Codes, Lecture Notes in Computer Science, vol. 3282. Springer-Verlag, Berlin (2004)."},{"key":"9445_CR14","unstructured":"Guruswami V., Sudan M.: Extensions to the Johnson bound. Unpublished manuscript (2001)."},{"key":"9445_CR15","doi-asserted-by":"crossref","first-page":"145","DOI":"10.4153\/CJM-1960-013-3","volume":"12","author":"H. Hanani","year":"1960","unstructured":"Hanani H.: On quadruple systems. Can. J. Math. 12, 145\u2013157 (1960)","journal-title":"Can. J. Math."},{"issue":"1","key":"9445_CR16","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s10623-004-5662-9","volume":"38","author":"L. Ji","year":"2006","unstructured":"Ji L.: Asymptotic determination of the last packing number of quadruples. Des. Codes Cryptogr. 38(1), 83\u201395 (2006)","journal-title":"Des. Codes Cryptogr."},{"key":"9445_CR17","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0012-365X(72)90027-1","volume":"3","author":"S.M. Johnson","year":"1972","unstructured":"Johnson S.M.: Upper bounds for constant weight error-correcting codes. Discrete Math. 3, 109\u2013124 (1972)","journal-title":"Discrete Math."},{"key":"9445_CR18","first-page":"363","volume":"1","author":"J. Sch\u00f6nheim","year":"1966","unstructured":"Sch\u00f6nheim J.: On maximal systems of k-tuples. Studia Sci. Math. Hungar 1, 363\u2013368 (1966)","journal-title":"Studia Sci. Math. Hungar"},{"key":"9445_CR19","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0019-9958(67)90052-6","volume":"10","author":"C.E. Shannon","year":"1967","unstructured":"Shannon C.E., Gallager R.G., Berlekamp E.R.: Lower bounds to error probability for coding on discrete memoryless channels. I. Inform. Control 10, 65\u2013103 (1967)","journal-title":"Inform. Control"},{"key":"9445_CR20","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1016\/S0019-9958(67)91200-4","volume":"10","author":"C.E. Shannon","year":"1967","unstructured":"Shannon C.E., Gallager R.G., Berlekamp E.R.: Lower bounds to error probability for coding on discrete memoryless channels. II. Inform. Control 10, 522\u2013552 (1967)","journal-title":"Inform. Control"},{"key":"9445_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0021-9800(68)80023-7","volume":"5","author":"J. Spencer","year":"1968","unstructured":"Spencer J.: Maximal consistent families of triples. J. Comb. Theory 5, 1\u20138 (1968)","journal-title":"J. Comb. Theory"},{"issue":"1","key":"9445_CR22","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1006\/jcom.1997.0439","volume":"13","author":"M. Sudan","year":"1997","unstructured":"Sudan M.: Decoding of Reed Solomon codes beyond the error-correction bound. J. Complex. 13(1), 180\u2013193 (1997)","journal-title":"J. Complex."},{"key":"9445_CR23","unstructured":"Wozencraft J.M.: List decoding. Research Laboratory of Electronics, Massachusetts Institute of Technology, Progress report 48, pp. 90\u201395 (1958)."},{"issue":"4","key":"9445_CR24","first-page":"236","volume":"17","author":"V.V. Zyablov","year":"1982","unstructured":"Zyablov V.V., Pinsker M.S.: List cascade decoding. Probl. Inform. Transm. 17(4), 236\u2013240 (1982)","journal-title":"Probl. Inform. Transm."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9445-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-010-9445-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9445-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T01:18:11Z","timestamp":1559783891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-010-9445-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,2]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9445"],"URL":"https:\/\/doi.org\/10.1007\/s10623-010-9445-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,2]]}}}