{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:34:52Z","timestamp":1725824092253},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_39","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T15:12:41Z","timestamp":1435072361000},"page":"495-506","source":"Crossref","is-referenced-by-count":0,"title":["Entropy of Weight Distributions of Small-Bias Spaces and Pseudobinomiality"],"prefix":"10.1007","author":[{"given":"Louay","family":"Bazzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"issue":"3","key":"39_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 and Algorithms 3(3), 289\u2013304 (1992)","journal-title":"Random Structures and Algorithms"},{"issue":"2","key":"39_CR2","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/PL00009813","volume":"18","author":"Y Azar","year":"1998","unstructured":"Azar, Y., Motwani, R., Naor, J.: Approximating probability distributions using small sample spaces. Combinatorica 18(2), 151\u2013171 (1998)","journal-title":"Combinatorica"},{"key":"39_CR3","unstructured":"Bazzi, L.: Entropy of weight distributions of small-bias spaces and pseudobinomiality. Submitted. Available at Electronic Colloquium on Computational Complexity, Report TR14-112 (2014)"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Cover, T., Thomas, J.: Elements of Information Theory, 2nd edn. Wiley (2006)","DOI":"10.1002\/047174882X"},{"key":"39_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-3-642-15369-3_38","volume-title":"Approximation, Randomization, and Combinatorial Optimization","author":"A De","year":"2010","unstructured":"De, A., Etesami, O., Trevisan, L., Tulsiani, M.: Improved pseudorandom generators. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX 2010. LNCS, vol. 6302, pp. 504\u2013517. Springer, Heidelberg (2010)"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"De, A.: Beyond the central limit theorem: asymptotic expansions and pseudorandomness for combinatorial sums. Available at Electronic Colloquium on Computational Complexity, Report TR14-125 (2014)","DOI":"10.1109\/FOCS.2015.59"},{"key":"39_CR7","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1137\/110854990","volume":"42","author":"P Gopalan","year":"2013","unstructured":"Gopalan, P., Meka, R., Reingold, O., Zuckerman, D.: Pseudorandom generators for combinatorial shapes. SIAM Journal of Computing 42, 1051\u20131076 (2013)","journal-title":"SIAM Journal of Computing"},{"key":"39_CR8","unstructured":"Gopalan, P., Kane, D., Meka, R.: Pseudorandomness for concentration bounds and signed majorities. arXiv:1411.4584 [cs.CC] (2014)"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Wigderson, A.: P = BPP if E requires exponential circuits: derandomizing the XOR lemma. In: Proc. 29th Annual ACM Symposium on the Theory of Computing, pp. 220\u2013229 (1997)","DOI":"10.1145\/258533.258590"},{"issue":"4","key":"39_CR10","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1109\/18.761251","volume":"45","author":"P Jacquet","year":"1999","unstructured":"Jacquet, P., Szpankowski, W.: Entropy computations via analytic depoissonization. IEEE Transactions on Information Theory. 45(4), 1072\u20131081 (1999)","journal-title":"IEEE Transactions on Information Theory."},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"Kahn, J., Kalai, G., Linial, N.: The influence of variables on Boolean functions. In: Proc. of the 29th Annual Symposium on Foundations of Computer Science, pp. 68\u201380 (1988)","DOI":"10.1109\/SFCS.1988.21923"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"Lechner, R.J.: Harmonic analysis of switching functions. In: Recent Development in Switching Theory, pp. 122\u2013229. Academic Press (1971)","DOI":"10.1016\/B978-0-12-509850-2.50010-5"},{"key":"39_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/978-3-642-03685-9_46","volume-title":"Approximation, Randomization, and Combinatorial Optimization","author":"S Lovett","year":"2009","unstructured":"Lovett, S., Reingold, O., Trevisan, L., Vadhan, S.: Pseudorandom bit generators that fool modular sums. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) Approximation, Randomization, and Combinatorial Optimization. LNCS, vol. 5687, pp. 615\u2013630. Springer, Heidelberg (2009)"},{"key":"39_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","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.) Approximation, Randomization, and Combinatorial Optimization. LNCS, vol. 5687, pp. 658\u2013672. Springer, Heidelberg (2009)"},{"issue":"4","key":"39_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: efficient constructions and applications. SIAM J. on Computing 22(4), 838\u2013856 (1993)","journal-title":"SIAM J. on Computing"},{"issue":"4","key":"39_CR16","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/BF01305237","volume":"12","author":"N Nisan","year":"1992","unstructured":"Nisan, N.: Pseudorandom generators for space-bounded computation. Combinatorica 12(4), 449\u2013461 (1992)","journal-title":"Combinatorica"},{"key":"39_CR17","doi-asserted-by":"crossref","unstructured":"Nisan, N., Wigderson, A.: Hardness vs. randomness. In: Proc. 29th IEEE Symposium on Foundations of Computer Science, pp. 2\u201311 (1988)","DOI":"10.1109\/SFCS.1988.21916"},{"key":"39_CR18","doi-asserted-by":"crossref","unstructured":"Rabani, Y., Shpilka, A.: Explicit construction of a small epsilon-net for linear threshold functions. In: Proc. 40th Annual ACM Symposium on Theory of Computing, pp. 649\u2013658 (2009)","DOI":"10.1145\/1536414.1536502"},{"key":"39_CR19","doi-asserted-by":"crossref","unstructured":"Viola, E.: The sum of d small-bias generators fools polynomials of degree d. In: IEEE Conference on Computational Complexity, pp. 124\u2013127 (2008)","DOI":"10.1109\/CCC.2008.16"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T16:15:37Z","timestamp":1566922537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}