{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T14:49:08Z","timestamp":1769525348909,"version":"3.49.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540551301","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0034343","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T01:19:19Z","timestamp":1134263959000},"page":"75-81","source":"Crossref","is-referenced-by-count":8,"title":["Saddle point techniques in asymptotic coding theory"],"prefix":"10.1007","author":[{"given":"Dani\u00e8le","family":"Gardy","sequence":"first","affiliation":[]},{"given":"Patrick","family":"Sol\u00e9","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0166-218X(84)90074-X","volume":"8","author":"J. Astola","year":"1984","unstructured":"J. Astola, \u201cOn the Asymptotic Behaviour of Lee codes,\u201d Discr. Appl. Math, Vol. 8, pp. 13\u201323 (1984).","journal-title":"Discr. Appl. Math"},{"key":"10_CR2","unstructured":"E.R. Berlekamp, Algebraic Coding Theory, Aegean Park Press (1984)."},{"key":"10_CR3","unstructured":"H. Cartan, Th\u00e9orie \u00e9l\u00e9mentaire des fonctions analytiques d'une ou plusieurs variables complexes, Hermann (1961)."},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1214\/aoms\/1177728652","volume":"25","author":"H.E. Daniels","year":"1954","unstructured":"H.E. Daniels, \u201cSaddlepoint Approximation in Statistics,\u201d Ann. Math. Stat., Vol. 25, pp. 631\u2013650 (1954).","journal-title":"Ann. Math. Stat."},{"key":"10_CR5","unstructured":"P. Henrici, Applied and Computational Analysis, Wiley (1977)."},{"key":"10_CR6","volume-title":"Th\u00e8se d'Etat","author":"D. Gardy","year":"1989","unstructured":"D. Gardy, Bases de donn\u00e9es, allocations al\u00e9atoires: quelques analyses de performances, Th\u00e8se d'Etat, Universit\u00e9 Paxis-Sud, Orsay (1989)."},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1214\/aoms\/1177706790","volume":"28","author":"I.J. Good","year":"1957","unstructured":"I.J. Good, \u201cSaddle point methods for the multinomial distribution,\u201d Ann. Math. Stat., Vol. 28, pp. 861\u2013881 (1957).","journal-title":"Ann. Math. Stat."},{"key":"10_CR8","unstructured":"D.H. Greene, D.E. Knuth, Mathematics for the analysis of algorithms, Birkh\u00e4user Verlag (1982)."},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1515\/crll.1956.196.67","volume":"196","author":"W.K. Hayman","year":"1956","unstructured":"W.K. Hayman, \u201cA generalisation of Stirling's formula,\u201d Journal f\u00fcr die reine und angewandte Mathematik, Vol. 196, pp. 67\u201395 (1956).","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1109\/18.61138","volume":"IT-37","author":"P. Sol\u00e9","year":"1991","unstructured":"P. Sol\u00e9, K. G. Mehrothra, \u201cA Generalization of the Norse Bound to Codes of Higher Strength,\u201d IEEE Trans. Information Theory, IT-37, pp. 190\u2013192 (1991).","journal-title":"IEEE Trans. Information Theory"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1109\/18.59949","volume":"IT-36","author":"A. Tiet\u00e4v\u00e4inen","year":"1990","unstructured":"A. Tiet\u00e4v\u00e4inen, \u201cAn Upper Bound on the Covering Radius as a Function of the Dual Distance,\u201d IEEE Trans. Information Theory, IT-36, pp. 1472\u20131474 (1990).","journal-title":"IEEE Trans. Information Theory"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"J. H. van Lint, Introduction to Coding Theory, Springer, Graduate Texts in Math. 86 (1982).","DOI":"10.1007\/978-3-662-07998-0"},{"key":"10_CR13","unstructured":"H.S. Wilf, Generatingfunctionology, Academic Press (1990)."}],"container-title":["Lecture Notes in Computer Science","Algebraic Coding"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0034343","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T17:20:15Z","timestamp":1683307215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0034343"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540551301"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0034343","relation":{},"subject":[]}}