{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:31:29Z","timestamp":1780054289462,"version":"3.54.0"},"reference-count":14,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T00:00:00Z","timestamp":1749600000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Israel Science Foundation (ISF)","award":["#1579\/23"],"award-info":[{"award-number":["#1579\/23"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>For the discrete-time AWGN channel with a power constraint, we give an alternative derivation for the sphere-packing upper bound on the optimal block error exponent and an alternative derivation for the analogous lower bound on the optimal correct-decoding exponent. The derivations use the method of types with finite alphabets of sizes depending on the block length n and with the number of types sub-exponential in n.<\/jats:p>","DOI":"10.3390\/e27060621","type":"journal-article","created":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T11:18:40Z","timestamp":1749640720000},"page":"621","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Method of Types for the AWGN Channel"],"prefix":"10.3390","volume":"27","author":[{"given":"Sergey","family":"Tridenski","sequence":"first","affiliation":[{"name":"Faculty of Engineering, Bar-Ilan University, Ramat Gan 5290002, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anelia","family":"Somekh-Baruch","sequence":"additional","affiliation":[{"name":"Faculty of Engineering, Bar-Ilan University, Ramat Gan 5290002, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2025,6,11]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Cover, T.M., and Thomas, J.A. (2006). Elements of Information Theory, John Wiley & Sons.","DOI":"10.1002\/047174882X"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1002\/j.1538-7305.1959.tb03905.x","article-title":"Probability of Error for Optimal Codes in a Gaussian Channel","volume":"38","author":"Shannon","year":"1959","journal-title":"Bell Syst. Tech. J."},{"key":"ref_3","unstructured":"Ebert, P.M. (1966). Error Bounds For Parallel Communication Channels, Research Laboratory of Electronics at Massachusetts Institute of Technology. Technical Report 448."},{"key":"ref_4","unstructured":"Gallager, R.G. (1968). Information Theory and Reliable Communication, John Wiley & Sons."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Oohama, Y. (2017, January 25\u201330). The Optimal Exponent Function for the Additive White Gaussian Noise Channel at Rates above the Capacity. Proceedings of the IEEE International Symposium on Information Theory (ISIT), Aachen, Germany.","DOI":"10.1109\/ISIT.2017.8006689"},{"key":"ref_6","unstructured":"Csisz\u00e1r, I., and K\u00f6rner, J. (1981). Information Theory: Coding Theorems for Discrete Memoryless Systems, Academic Press."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/TIT.1979.1056003","article-title":"Reliability Function of a Discrete Memoryless Channel at Rates above Capacity","volume":"25","author":"Dueck","year":"1979","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1134\/S0032946020030011","article-title":"The Sphere Packing Bound for Memoryless Channels","volume":"56","year":"2020","journal-title":"Probl. Inf. Transm."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Verd\u00fa, S. (2021). Error Exponents and \u03b1-Mutual Information. Entropy, 23.","DOI":"10.3390\/e23020199"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"2505","DOI":"10.1109\/18.720546","article-title":"The Method of Types","volume":"44","year":"1998","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_11","unstructured":"Andrews, G.E. (1976). The Theory of Partitions, Cambridge University Press."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Tridenski, S., and Somekh-Baruch, A. (2024, January 7\u201312). The Method of Types for the AWGN Channel: Error Exponent. Proceedings of the IEEE International Symposium on Information Theory (ISIT), Athens, Greece.","DOI":"10.1109\/ISIT57864.2024.10619552"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Tridenski, S., and Somekh-Baruch, A. (2024, January 6\u20138). The Method of Types for the AWGN Channel: Correct-Decoding Exponent. Proceedings of the International Zurich Seminar on Information and Communication (IZS), Zurich, Switzerland.","DOI":"10.1109\/ISIT57864.2024.10619552"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Cheng, H.-C., and Nakibo\u011flu, B. (2020, January 21\u201326). Refined Strong Converse for the Constant Composition Codes. Proceedings of the IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA.","DOI":"10.1109\/ISIT44484.2020.9174315"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/6\/621\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:50:16Z","timestamp":1760032216000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/6\/621"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,11]]},"references-count":14,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2025,6]]}},"alternative-id":["e27060621"],"URL":"https:\/\/doi.org\/10.3390\/e27060621","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,11]]}}}