메뉴 건너뛰기




Volumn 59, Issue 11, 2013, Pages 7041-7051

A tight upper bound for the third-order asymptotics for most discrete memoryless channels

Author keywords

Channel coding converse; discrete memoryless channel; dispersion; finite blocklength; second order coding rates; third order asymptotics

Indexed keywords

AVERAGE ERROR PROBABILITY; CODING RATE; DISCRETE MEMORYLESS CHANNELS; DISPERSION CAPACITY; ERROR CAPACITY; FINITE BLOCKLENGTH; NORMAL APPROXIMATION; THIRD-ORDER ASYMPTOTICS;

EID: 84886705884     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2013.2276077     Document Type: Article
Times cited : (75)

References (22)
  • 1
    • 84856043672 scopus 로고
    • A mathematical theory of communication
    • C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423, 1948.
    • (1948) Bell Syst. Tech. J. , vol.27 , pp. 379-423
    • Shannon, C.E.1
  • 3
    • 52349101372 scopus 로고
    • Asymptotische Abschätzungen in Shannons informationstheorie
    • Prague
    • V. Strassen, "Asymptotische Abschätzungen in Shannons informationstheorie," in Trans. Third Prague Conf. Inf. Theory, Prague, 1962, pp. 689-723.
    • (1962) Trans. Third Prague Conf. Inf. Theory , pp. 689-723
    • Strassen, V.1
  • 4
    • 77951624674 scopus 로고    scopus 로고
    • Channel coding in the finite blocklength regime
    • May
    • Y. Polyanskiy, H. V. Poor, and S. Verdú, "Channel coding in the finite blocklength regime," IEEE Trans. Inf. Theory, vol. 56, pp. 2307-59, May 2010.
    • (2010) IEEE Trans. Inf. Theory , vol.56 , pp. 2307-2359
    • Polyanskiy, Y.1    Poor, H.V.2    Verdú, S.3
  • 6
    • 70350714497 scopus 로고    scopus 로고
    • Information spectrum approach to second-order coding rate in channel coding
    • Nov
    • M. Hayashi, "Information spectrum approach to second-order coding rate in channel coding," IEEE Trans. Inf. Theory, vol. 55, no. 11, pp. 4947-66, Nov. 2009.
    • (2009) IEEE Trans. Inf. Theory , vol.55 , Issue.11 , pp. 4947-4966
    • Hayashi, M.1
  • 7
    • 84867543546 scopus 로고    scopus 로고
    • The log-volume of optimal constant-composition codes for memoryless channels, within bits
    • presented, Cambridge, MA, USA
    • P.Moulin, "The log-volume of optimal constant-composition codes for memoryless channels, within bits," presented at the Int. Symp. Inf. Theory, Cambridge, MA, USA, 2012.
    • (2012) The Int. Symp. Inf. Theory
    • Moulin, P.1
  • 8
    • 0001053010 scopus 로고
    • Strong large deviation and local limit theorems
    • N. R. Chaganty and J. Sethuraman, "Strong large deviation and local limit theorems," Ann. Prob., vol. 21, no. 3, pp. 1671-90, 1993.
    • (1993) Ann. Prob. , vol.21 , Issue.3 , pp. 1671-1690
    • Chaganty, N.R.1    Sethuraman, J.2
  • 9
    • 0001505964 scopus 로고
    • On deviations of the sample mean
    • R. Bahadur and R. Ranga, "On deviations of the sample mean," Ann. Math. Statist., vol. 31, pp. 1015-27, 1960.
    • (1960) Ann. Math. Statist. , vol.31 , pp. 1015-1027
    • Bahadur, R.1    Ranga, R.2
  • 10
    • 84876745115 scopus 로고    scopus 로고
    • The log-volume of optimal codes for memoryless channels, up to a few nats
    • presented, San Diego, CA, USA
    • P. Moulin, "The log-volume of optimal codes for memoryless channels, up to a few nats," presented at the Inf. Theory Appl. Workshop, San Diego, CA, USA, 2012.
    • (2012) The Inf. Theory Appl. Workshop
    • Moulin, P.1
  • 15
    • 84861651671 scopus 로고    scopus 로고
    • One-shot classical-quantum capacity and hypothesis testing
    • May
    • L.Wang and R. Renner, "One-shot classical-quantum capacity and hypothesis testing," Phys. Rev. Lett., vol. 108, p. 200501, May 2012.
    • (2012) Phys. Rev. Lett. , vol.108 , pp. 200501
    • Wang, L.1    Renner, R.2
  • 16
    • 84886667723 scopus 로고    scopus 로고
    • A hierarchy of information quantities for finite block length analysis of quantum tasks
    • [Online]. arXiv:1208.1478, accepted for publication
    • M. Tomamichel and M. Hayashi, "A hierarchy of information quantities for finite block length analysis of quantum tasks," IEEE Trans. Inf. Theory [Online]. Available: arXiv:1208.1478, accepted for publication
    • IEEE Trans. Inf. Theory
    • Tomamichel, M.1    Hayashi, M.2
  • 18
    • 84886700134 scopus 로고
    • Über einen Grenzwertsatz, der mit dem Begriff der Entropie einer Markoffschen Kette zusammenhängt
    • Juschkewtisch, "Über einen Grenzwertsatz, der mit dem Begriff der Entropie einer Markoffschen Kette zusammenhängt," Uspechi Mat. Nauk VIII, vol. 5, 1953.
    • (1953) Uspechi Mat. Nauk VIII , vol.5
    • Juschkewtisch1
  • 20
    • 84876755742 scopus 로고    scopus 로고
    • Saddle point in the minimax converse for channel coding
    • May
    • Y. Polyanskiy, "Saddle point in the minimax converse for channel coding," IEEE Trans. Inf. Theory, vol. 59, no. 5, pp. 2576-95, May 2013.
    • (2013) IEEE Trans. Inf. Theory , vol.59 , Issue.5 , pp. 2576-2595
    • Polyanskiy, Y.1
  • 21
    • 33744799923 scopus 로고    scopus 로고
    • Context tree estimation for not necessarily finite memory processes, Via BIC and MDL
    • DOI 10.1109/TIT.2005.864431
    • I. Csiszár and Z. Talata, "Context tree estimation for not necessarily finite memory processes, via BIC and MDL," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 1007-16, Mar. 2006. (Pubitemid 46444888)
    • (2006) IEEE Transactions on Information Theory , vol.52 , Issue.3 , pp. 1007-1016
    • Csiszar, I.1    Talata, Z.2
  • 22
    • 84873892076 scopus 로고    scopus 로고
    • Finite-dimensional infinite constellations
    • Mar
    • A. Ingber, R. Zamir, and M. Feder, "Finite-dimensional infinite constellations," IEEE Trans. Inf. Theory, vol. 59, no. 3, pp. 1630-56, Mar. 2013.
    • (2013) IEEE Trans. Inf. Theory , vol.59 , Issue.3 , pp. 1630-1656
    • Ingber, A.1    Zamir, R.2    Feder, M.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.