{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:00:19Z","timestamp":1725890419328},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316616"},{"type":"electronic","value":"9783642316623"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31662-3_3","type":"book-chapter","created":{"date-parts":[[2012,7,2]],"date-time":"2012-07-02T06:10:20Z","timestamp":1341209420000},"page":"29-44","source":"Crossref","is-referenced-by-count":0,"title":["A New Method for Constructing Small-Bias Spaces from Hermitian Codes"],"prefix":"10.1007","author":[{"given":"Olav","family":"Geil","sequence":"first","affiliation":[]},{"given":"Stefano","family":"Martin","sequence":"additional","affiliation":[]},{"given":"Ryutaroh","family":"Matsumoto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N. Alon","year":"1992","unstructured":"Alon, N., Goldreich, O., Hastad, J., Peralta, R.: Simple constructions of almost k-wise independent random variables. Random Structures Algorithms\u00a03(3), 289\u2013303 (1992)","journal-title":"Random Structures Algorithms"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Aroya, A., Ta-Shma, A.: Constructing small-bias sets from algebraic-geometric codes. In: FOCS 2009, pp. 191\u2013197 (2009)","DOI":"10.1109\/FOCS.2009.44"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Ideals, Varieties, and Algorithms, 2nd edn. Springer (1997)","DOI":"10.1007\/978-1-4757-2693-0"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1008274212057","volume":"13","author":"J. Fitzgerald","year":"1998","unstructured":"Fitzgerald, J., Lax, R.F.: Decoding Affine Variety Codes Using Gr\u00f6bner Bases. Des. Codes Cryptography\u00a013, 147\u2013158 (1998)","journal-title":"Des. Codes Cryptography"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1006\/jnth.1996.0147","volume":"61","author":"A. Garcia","year":"1996","unstructured":"Garcia, A., Stichtenoth, H.: On the asymptotic behaviour of some towers of function fields over finite fields. J. Number Theory\u00a061, 248\u2013273 (1996)","journal-title":"J. Number Theory"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/S1071-5797(03)00010-8","volume":"9","author":"O. Geil","year":"2003","unstructured":"Geil, O.: On codes from norm-trace curves. Finite Fields and their Applications\u00a09, 351\u2013371 (2003)","journal-title":"Finite Fields and their Applications"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1109\/18.825832","volume":"46","author":"O. Geil","year":"2000","unstructured":"Geil, O., H\u00f8holdt, T.: Footprints or Generalized Bezout\u2019s Theorem. IEEE Trans. Inform. Theory\u00a046, 635\u2013641 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Geil, O., H\u00f8holdt, T.: On Hyperbolic Type Codes. In: Proceedings of 2003 IEEE International Symposium on Inf. Theory, Yokohama, p. 331 (2003)","DOI":"10.1109\/ISIT.2003.1228346"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-1-4615-5121-8_1","volume-title":"Codes, Curves and Signals","author":"T. H\u00f8holdt","year":"1998","unstructured":"H\u00f8holdt, T.: On (or in) Dick Blahut\u2019s \u2019footprint\u2019. In: Vardy, A. (ed.) Codes, Curves and Signals, pp. 3\u20139. Kluwer Academic, Norwell (1998)"},{"key":"3_CR10","first-page":"871","volume-title":"Handbook of Coding Theory","author":"T. H\u00f8holdt","year":"1998","unstructured":"H\u00f8holdt, T., van Lint, J., Pellikaan, R.: Algebraic Geometry Codes. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding Theory, vol.\u00a01, ch. 10, pp. 871\u2013961. Elsevier, Amsterdam (1998)"},{"key":"3_CR11","unstructured":"Miura, S., Kamiya, N.: Geometric-Goppa codes on some maximal curves and their minimum distance. In: Proc. of 1993 IEEE Inf. Th. Workshop, Susonon-shi, Shizuoka, Japan, June 4-8, pp. 85\u201386 (1993)"},{"key":"3_CR12","unstructured":"Matthews, G.L., Peachey, J.: Small-bias sets from extended norm-trace codes. To appear in Proceedings of Fq10, Contemporary Mathematics. AMS"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1109\/TIT.1973.1054936","volume":"19","author":"J. Massey","year":"1973","unstructured":"Massey, J., Costello, D.J., Justesen, J.: Polynomial Weights and Code Constructions. IEEE Trans. Inf. Theory\u00a019, 101\u2013110 (1973)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1007\/978-3-642-03685-9_49","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"R. Meka","year":"2009","unstructured":"Meka, R., Zuckerman, D.: Small-Bias Spaces for Group Products. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX and RANDOM 2009. LNCS, vol.\u00a05687, pp. 658\u2013672. Springer, Heidelberg (2009)"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"J. Naor","year":"1993","unstructured":"Naor, J., Naor, M.: Small-bias probability spaces: eficient construction and applications. SIAM J. Comput.\u00a022, 838\u2013856 (1993)","journal-title":"SIAM J. Comput."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"2225","DOI":"10.1109\/18.945244","volume":"47","author":"K.W. Shum","year":"2001","unstructured":"Shum, K.W., Aleshnikov, I., Vijay Kumar, P., Stichtenoth, H., Deolalikar, V.: A Low-Complexity Algorithm for the Construction of Algebraic-Geometric Codes Better Than the Gilbert-Varshamov Bound. IEEE Trans. Inform. Theory\u00a047, 2225\u20132241 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3_CR17","unstructured":"Vazirani, U.V.: Randomness, adversaries, and computation, Ph.D. thesis, EECS, UC Berkeley (1986)"}],"container-title":["Lecture Notes in Computer Science","Arithmetic of Finite Fields"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31662-3_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:43:01Z","timestamp":1620114181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31662-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316616","9783642316623"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31662-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}