{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:57:05Z","timestamp":1759939025147},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T00:00:00Z","timestamp":1228867200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1007\/s00454-008-9128-0","type":"journal-article","created":{"date-parts":[[2008,12,9]],"date-time":"2008-12-09T15:45:54Z","timestamp":1228837554000},"page":"199-207","source":"Crossref","is-referenced-by-count":20,"title":["Linear Programming Bounds for Codes via a Covering Argument"],"prefix":"10.1007","volume":"41","author":[{"given":"Michael","family":"Navon","sequence":"first","affiliation":[]},{"given":"Alex","family":"Samorodnitsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,12,10]]},"reference":[{"issue":"1","key":"9128_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF02122549","volume":"8","author":"R. Aharoni","year":"1988","unstructured":"Aharoni, R., Erdos, P., Linial, N.: Optima of dual integer linear programs. Combinatorica 8(1), 13\u201320 (1988)","journal-title":"Combinatorica"},{"issue":"4","key":"9128_CR2","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N. Alon","year":"1986","unstructured":"Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms 7(4), 567\u2013583 (1986)","journal-title":"J. Algorithms"},{"key":"9128_CR3","doi-asserted-by":"crossref","first-page":"1808","DOI":"10.1109\/18.782101","volume":"IT-45","author":"A. Ashkihmin","year":"1999","unstructured":"Ashkihmin, A., Honkala, I., Laihonen, T., Litsyn, S.: On relations between covering radius and dual distance. IEEE Trans. Inf. Theory IT-45, 1808\u20131816 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9128_CR4","volume-title":"Algebraic Combinatorics I: Association Schemes","author":"E. Bannai","year":"1984","unstructured":"Bannai, E., Ito, T.: Algebraic Combinatorics I: Association Schemes. Benjamin-Cummings, Redwood City (1984)"},{"key":"9128_CR5","volume-title":"Covering Codes","author":"G. Cohen","year":"1997","unstructured":"Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering Codes. Elsevier, Amsterdam (1997)"},{"key":"9128_CR6","doi-asserted-by":"crossref","first-page":"689","DOI":"10.4007\/annals.2003.157.689","volume":"157","author":"H. Cohn","year":"2003","unstructured":"Cohn, H., Elkies, N.: New upper bounds for sphere packings I. Ann. Math. 157, 689\u2013714 (2003)","journal-title":"Ann. Math."},{"key":"9128_CR7","unstructured":"Delsarte, P.: An algebraic approach to the association schemes of coding theory. Philips Res. Rep., Suppl. 10 (1973)"},{"key":"9128_CR8","unstructured":"Friedman, J., Tillich, J.-P.: Generalized Alon\u2013Boppana theorems and error-correcting codes. Preprint (2002)"},{"key":"9128_CR9","doi-asserted-by":"crossref","unstructured":"Kahn, J., Kalai, G., Linial, N.: The influence of variables on Boolean functions. In: FOCS, pp.\u00a068\u201380. (1988)","DOI":"10.1109\/SFCS.1988.21923"},{"key":"9128_CR10","unstructured":"Kalai, G., Linial, N.: Personal communication"},{"key":"9128_CR11","volume-title":"Handbook of Coding Theory","author":"V.I. Levenshtein","year":"1998","unstructured":"Levenshtein, V.I.: Universal bounds for codes and designs. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding Theory. Amsterdam, Elsevier (1998)"},{"key":"9128_CR12","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lovasz","year":"1975","unstructured":"Lovasz, L.: On the ratio of optimal integral and fractional covers. Discrete Math. 13, 383\u2013390 (1975)","journal-title":"Discrete Math."},{"key":"9128_CR13","volume-title":"The Theory of Error Correcting Codes","author":"J. MacWilliams","year":"1977","unstructured":"MacWilliams, J., Sloane, N.J.A.: The Theory of Error Correcting Codes. Amsterdam, North-Holland (1977)"},{"key":"9128_CR14","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1109\/TIT.1977.1055688","volume":"IT-23","author":"R.J. McEliece","year":"1977","unstructured":"McEliece, R.J., Rodemich, E.R., Rumsey, H. Jr., Welch, L.R.: New upper bounds on the rate of a code via the Delsarte\u2013MacWilliams inequalities. IEEE Trans. Inf. Theory IT-23, 157\u2013166 (1977)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9128_CR15","unstructured":"Navon, M., Samorodnitsky, A.: On Delsarte\u2019s linear programming bounds for binary codes. In: Proceedings of FOCS 46"},{"key":"9128_CR16","unstructured":"Samorodnitsky, A.: The proof of the first JPL bound for association schemes via formal Fourier transform. Manuscript (2006)"},{"key":"9128_CR17","unstructured":"Samorodnitsky, A.: A modified logarithmic Sobolev inequality for the Hamming cube and some applications. arXiv:0807.1679 (2008)"},{"key":"9128_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58575-3","volume-title":"Introduction to Coding Theory","author":"J.H. Lint van","year":"1999","unstructured":"van Lint, J.H.: Introduction to Coding Theory, 3rd edn. Springer, Berlin (1999)","edition":"3"},{"key":"9128_CR19","doi-asserted-by":"crossref","DOI":"10.1090\/coll\/023","volume-title":"Orthogonal Polynomials","author":"G. Szeg\u00f6","year":"1939","unstructured":"Szeg\u00f6, G.: Orthogonal Polynomials. Am. Math. Soc., Providence (1939)"},{"key":"9128_CR20","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1109\/18.59949","volume":"IT-36","author":"A. Tietavainen","year":"1990","unstructured":"Tietavainen, A.: Upper bound on the covering radius of a code as a function of its dual distance. IEEE Trans. Inf. Theory IT-36, 1472\u20131474 (1990)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-008-9128-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-008-9128-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-008-9128-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:47:36Z","timestamp":1559072856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-008-9128-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,10]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["9128"],"URL":"https:\/\/doi.org\/10.1007\/s00454-008-9128-0","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,10]]}}}