{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:44:57Z","timestamp":1742917497780,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642299513"},{"type":"electronic","value":"9783642299520"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29952-0_31","type":"book-chapter","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T06:14:09Z","timestamp":1336025649000},"page":"295-306","source":"Crossref","is-referenced-by-count":0,"title":["Stopping Set Distributions of Algebraic Geometry Codes from Elliptic Curves"],"prefix":"10.1007","author":[{"given":"Jun","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Fang-Wei","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Daqing","family":"Wan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Schwartz, M., Vardy, A.: On the stopping distance and the stopping redundancy of codes. In: Proceedings International Symposium on Information Theory, ISIT 2005, pp. 975\u2013979 (2005)","DOI":"10.1109\/ISIT.2005.1523483"},{"issue":"3","key":"31_CR2","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1109\/TIT.2005.864441","volume":"52","author":"M. Schwartz","year":"2006","unstructured":"Schwartz, M., Vardy, A.: On the stopping distance and the stopping redundancy of codes. IEEE Transactions on Information Theory\u00a052(3), 922\u2013932 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"31_CR3","doi-asserted-by":"publisher","first-page":"4867","DOI":"10.1109\/TIT.2006.883542","volume":"52","author":"T. Etzion","year":"2006","unstructured":"Etzion, T.: On the stopping redundancy of Reed-Muller codes. IEEE Transactions on Information Theory\u00a052(11), 4867\u20134879 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Han, J., Siegel, P.: On the stopping redundancy of MDS codes. In: IEEE International Symposium on Information Theory, pp. 2491\u20132495 (July 2006)","DOI":"10.1109\/ISIT.2006.262059"},{"issue":"9","key":"31_CR5","doi-asserted-by":"publisher","first-page":"4155","DOI":"10.1109\/TIT.2009.2025578","volume":"55","author":"J. Han","year":"2009","unstructured":"Han, J., Siegel, P., Roth, R.: Single-exclusion number and the stopping redundancy of MDS codes. IEEE Transactions on Information Theory\u00a055(9), 4155\u20134166 (2009)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"31_CR6","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1109\/TIT.2006.887513","volume":"53","author":"J. Han","year":"2007","unstructured":"Han, J., Siegel, P.H.: Improved upper bounds on stopping redundancy. IEEE Transactions on Information Theory\u00a053(1), 90\u2013104 (2007)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"9","key":"31_CR7","doi-asserted-by":"publisher","first-page":"6078","DOI":"10.1109\/TIT.2011.2162181","volume":"57","author":"Y. Jiang","year":"2011","unstructured":"Jiang, Y., Xia, S.T., Fu, F.W.: Stopping set distributions of some Reed-Muller codes. IEEE Transactions on Information Theory\u00a057(9), 6078\u20136088 (2011)","journal-title":"IEEE Transactions on Information Theory"},{"key":"31_CR8","first-page":"47","volume-title":"Information Theory Workshop, ITW 2006","author":"S.T. Xia","year":"2006","unstructured":"Xia, S.T., Fu, F.W.: Stopping set distributions of some linear codes. In: Information Theory Workshop, ITW 2006, pp. 47\u201351. IEEE, Chengdu (2006)"},{"issue":"5","key":"31_CR9","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1109\/LCOMM.2006.1633330","volume":"10","author":"S.T. Xia","year":"2006","unstructured":"Xia, S.T., Fu, F.W.: On the stopping distance of finite geometry LDPC codes. IEEE Communications Letters\u00a010(5), 381\u2013383 (2006)","journal-title":"IEEE Communications Letters"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Weber, J., Abdel-Ghaffar, K.: Stopping set analysis for Hamming codes. In: 2005 IEEE Information Theory Workshop, p. 4 (August- September 1, 2005)","DOI":"10.1109\/ITW.2005.1531897"},{"issue":"11","key":"31_CR11","doi-asserted-by":"publisher","first-page":"4991","DOI":"10.1109\/TIT.2008.929973","volume":"54","author":"T. Wadayama","year":"2008","unstructured":"Wadayama, T.: Average stopping set weight distributions of redundant random ensembles. IEEE Transactions on Information Theory\u00a054(11), 4991\u20135004 (2008)","journal-title":"IEEE Transactions on Information Theory"},{"key":"31_CR12","unstructured":"Ikegaya, R., Kasai, K., Shibuya, T., Sakaniwa, K.: Asymptotic weight and stopping set distributions for detailedly represented irregular LDPC code ensembles. In: Proceedings. International Symposium on Information Theory, ISIT 2004, p. 208 (June-July 2, 2004)"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1109\/TIT.2004.842571","volume":"51","author":"A. Orlitsky","year":"2005","unstructured":"Orlitsky, A., Viswanathan, K., Zhang, J.: Stopping set distribution of LDPC code ensembles. IEEE Transactions on Information Theory\u00a051, 929\u2013953 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"31_CR14","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1109\/TCOMM.2006.888633","volume":"55","author":"S. Laendner","year":"2007","unstructured":"Laendner, S., Milenkovic, O.: LDPC codes based on latin squares: Cycle structure, stopping set, and trapping set analysis. IEEE Transactions on Communications\u00a055(2), 303\u2013312 (2007)","journal-title":"IEEE Transactions on Communications"},{"issue":"6","key":"31_CR15","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/TIT.2007.896864","volume":"53","author":"K. Krishnan","year":"2007","unstructured":"Krishnan, K., Shankar, P.: Computing the stopping distance of a Tanner graph is NP-hard. IEEE Transactions on Information Theory\u00a053(6), 2278\u20132280 (2007)","journal-title":"IEEE Transactions on Information Theory"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Kashyap, N., Vardy, A.: Stopping sets in codes from designs. In: Proceedings of IEEE International Symposium on Information Theory, p. 122 (June -July 4, 2003)","DOI":"10.1109\/ISIT.2003.1228136"},{"issue":"2","key":"31_CR17","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1109\/TIT.2006.888996","volume":"53","author":"H.D.L. Hollmann","year":"2007","unstructured":"Hollmann, H.D.L., Tolhuizen, L.M.G.M.: On parity-check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size. IEEE Transactions on Information Theory\u00a053(2), 823\u2013828 (2007)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"12","key":"31_CR18","doi-asserted-by":"publisher","first-page":"5308","DOI":"10.1109\/TIT.2008.2006456","volume":"54","author":"T. Hehn","year":"2008","unstructured":"Hehn, T., Milenkovic, O., Laendner, S., Huber, J.: Permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic codes. IEEE Transactions on Information Theory\u00a054(12), 5308\u20135331 (2008)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"31_CR19","doi-asserted-by":"publisher","first-page":"1749","DOI":"10.1109\/TIT.2008.917624","volume":"54","author":"J. Han","year":"2008","unstructured":"Han, J., Siegel, P., Vardy, A.: Improved probabilistic bounds on stopping redundancy. IEEE Transactions on Information Theory\u00a054(4), 1749\u20131753 (2008)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"31_CR20","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1109\/TIT.2004.842696","volume":"51","author":"J. Feldman","year":"2005","unstructured":"Feldman, J., Wainwright, M., Karger, D.: Using linear programming to decode binary linear codes. IEEE Transactions on Information Theory\u00a051(3), 954\u2013972 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"8","key":"31_CR21","doi-asserted-by":"publisher","first-page":"3488","DOI":"10.1109\/TIT.2009.2023736","volume":"55","author":"M. Esmaeili","year":"2009","unstructured":"Esmaeili, M., Amoshahy, M.: On the stopping distance of array code parity-check matrices. IEEE Transactions on Information Theory\u00a055(8), 3488\u20133493 (2009)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"31_CR22","doi-asserted-by":"publisher","first-page":"1570","DOI":"10.1109\/TIT.2002.1003839","volume":"48","author":"C. Di","year":"2002","unstructured":"Di, C., Proietti, D., Telatar, I., Richardson, T., Urbanke, R.: Finite-length analysis of low-density parity-check codes on the binary erasure channel. IEEE Transactions on Information Theory\u00a048(6), 1570\u20131579 (2002)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"9","key":"31_CR23","doi-asserted-by":"publisher","first-page":"3196","DOI":"10.1109\/TIT.2007.903137","volume":"53","author":"K. Abdel-Ghaffar","year":"2007","unstructured":"Abdel-Ghaffar, K., Weber, J.: Complete enumeration of stopping sets of full-rank parity-check matrices of Hamming codes. IEEE Transactions on Information Theory\u00a053(9), 3196\u20133201 (2007)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"31_CR24","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"R. Tanner","year":"1981","unstructured":"Tanner, R.: A recursive approach to low complexity codes. IEEE Transactions on Information Theory\u00a027(5), 533\u2013547 (1981)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"8","key":"31_CR25","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1016\/j.jcta.2006.03.024","volume":"113","author":"H.D. Hollmann","year":"2006","unstructured":"Hollmann, H.D., Tolhuizen, L.M.: Generic erasure correcting sets: Bounds and constructions. Journal of Combinatorial Theory, Series A\u00a0113(8), 1746\u20131759 (2006); Special Issue in Honor of Jacobus H. van Lint","journal-title":"Journal of Combinatorial Theory, Series A"},{"issue":"6","key":"31_CR26","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.641542","volume":"43","author":"A. Vardy","year":"1997","unstructured":"Vardy, A.: The intractability of computing the minimum distance of a code. IEEE Transactions on Information Theory\u00a043(6), 1757\u20131766 (1997)","journal-title":"IEEE Transactions on Information Theory"},{"key":"31_CR27","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/1536414.1536421","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009","author":"Q. Cheng","year":"2009","unstructured":"Cheng, Q., Wan, D.: A deterministic reduction for the gap minimum distance problem: [extended abstract]. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 33\u201338. ACM, New York (2009)"},{"key":"31_CR28","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-76878-4","volume-title":"Algebraic function fields and codes","author":"H. Stichtenoth","year":"2009","unstructured":"Stichtenoth, H.: Algebraic function fields and codes, 2nd edn. Graduate Texts in Mathematics, vol.\u00a0254. Springer, Berlin (2009)","edition":"2"},{"key":"31_CR29","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1109\/TIT.2007.911213","volume":"54","author":"Q. Cheng","year":"2008","unstructured":"Cheng, Q.: Hard problems of algebraic geometry codes. IEEE Transactions on Information Theory\u00a054, 402\u2013406 (2008)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"31_CR30","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0097-3165(87)90003-3","volume":"46","author":"R. Schoof","year":"1987","unstructured":"Schoof, R.: Nonsingular plane cubic curves over finite fields. J. Comb. Theory, Ser. A\u00a046(2), 183\u2013211 (1987)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"31_CR31","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09494-6","volume-title":"The arithmetic of elliptic curves","author":"J.H. Silverman","year":"2009","unstructured":"Silverman, J.H.: The arithmetic of elliptic curves, 2nd edn. Graduate Texts in Mathematics, vol.\u00a0106. Springer, Dordrecht (2009)","edition":"2"},{"issue":"1","key":"31_CR32","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.jcta.2011.07.003","volume":"119","author":"J. Li","year":"2012","unstructured":"Li, J., Wan, D.: Counting subset sums of finite abelian groups. Journal of Combinatorial Theory, Series A\u00a0119(1), 170\u2013182 (2012)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"31_CR33","doi-asserted-by":"crossref","first-page":"455","DOI":"10.24033\/bsmf.2107","volume":"116","author":"F. Voloch","year":"1988","unstructured":"Voloch, F.: A note on ellipic curves over finite fields. Bull. Soc. Math. France\u00a0116, 455\u2013458 (1988)","journal-title":"Bull. Soc. Math. France"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29952-0_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T00:55:57Z","timestamp":1676768157000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-29952-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299513","9783642299520"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29952-0_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}