메뉴 건너뛰기




Volumn 42, Issue 5, 1996, Pages 1439-1452

Mismatched decoding and the multiple-access channel

Author keywords

Capacity region; Mismatched decoding; Multiple access channel

Indexed keywords

CHANNEL CAPACITY; COMMUNICATION CHANNELS (INFORMATION THEORY); ERRORS; INFORMATION THEORY; MATHEMATICAL MODELS; PROBABILITY; SIGNAL ENCODING;

EID: 0030243474     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.532884     Document Type: Article
Times cited : (85)

References (12)
  • 1
    • 0029253576 scopus 로고
    • Decoding under integer metrics constraints
    • Feb./Apr.
    • J. Salz and E. Zehavi, "Decoding under integer metrics constraints," IEEE Trans. Commun., vol. 43, nos. 2-4, pp. 307-317, Feb./Apr. 1995.
    • (1995) IEEE Trans. Commun. , vol.43 , Issue.2-4 , pp. 307-317
    • Salz, J.1    Zehavi, E.2
  • 3
    • 33747472001 scopus 로고
    • Universal decoding tor finite-state channels
    • July
    • J. Ziv, "Universal decoding tor finite-state channels," IEEE Trans. Inform. Theory., vol. IT-31, no. 4, pp. 453-460, July 1985.
    • (1985) IEEE Trans. Inform. Theory. , vol.IT-31 , Issue.4 , pp. 453-460
    • Ziv, J.1
  • 4
    • 84890370899 scopus 로고
    • Coding theorem for discrete memoryless channels with given decision rules
    • (Lecture notes in Computer Science 573), G. Cohen, S. Litsyn, A. Lobstein, and G. Zémor, Eds. Berlin: Springer-Verlag, July
    • V. B. Balakirsky, "Coding theorem for discrete memoryless channels with given decision rules," in Proc. 1st French-Soviet Workshop on Algebraic Coding (Lecture notes in Computer Science 573), G. Cohen, S. Litsyn, A. Lobstein, and G. Zémor, Eds. Berlin: Springer-Verlag, July 1991, pp. 142-150.
    • (1991) Proc. 1st French-Soviet Workshop on Algebraic Coding , pp. 142-150
    • Balakirsky, V.B.1
  • 5
    • 0029219819 scopus 로고
    • Channel capacity for a given decoding metric
    • Jan
    • I. Csiszãr and P. Narayan, "Channel capacity for a given decoding metric," IEEE Trans. Inform. Theory, vol. 41, no. 1, pp. 35-43, Jan, 1995.
    • (1995) IEEE Trans. Inform. Theory , vol.41 , Issue.1 , pp. 35-43
    • Csiszãr, I.1    Narayan, P.2
  • 6
    • 0028549476 scopus 로고
    • On information rates for mismatched decoders
    • Nov.
    • N. Merhav, G. Kaplan, A. Lapidoth, and S. Shamai (Shitz), "On information rates for mismatched decoders." IEEE Trans. Inform. Theory., vol. 40, no. 6, pp. 1953-1967, Nov. 1994.
    • (1994) IEEE Trans. Inform. Theory. , vol.40 , Issue.6 , pp. 1953-1967
    • Merhav, N.1    Kaplan, G.2    Lapidoth, A.3    Shamai, S.4
  • 7
    • 0019393959 scopus 로고
    • Graph decomposition: A new key to coding theorems
    • Jan.
    • I. Csiszár and J. Körner, "Graph decomposition: A new key to coding theorems," IF.F.F. Trans. Inform. Theory, vol. IT-27, no. 9, pp. 5-12, Jan. 1981.
    • (1981) IF.F.F. Trans. Inform. Theory , vol.IT-27 , Issue.9 , pp. 5-12
    • Csiszár, I.1    Körner, J.2
  • 8
    • 33747091233 scopus 로고
    • Ph.D. disser-talion, Massachusetts Institute of Technology, Cambridge, MA
    • J. Y. N. Hui, "Fundamental issues of multiple accessing," Ph.D. disser-talion, Massachusetts Institute of Technology, Cambridge, MA, 1983.
    • (1983) Fundamental Issues of Multiple Accessing
    • Hui, J.Y.N.1
  • 9
    • 0029404936 scopus 로고
    • A converse coding theorem for mismatched decoding at the output of binary-input memoryless channels
    • Nov.
    • V. B. Balakirsky, "A converse coding theorem for mismatched decoding at the output of binary-input memoryless channels," IEEE Trans, Inform. Theory, vol. 41, no. 6, pp. 1889-1902, Nov. 1995.
    • (1995) IEEE Trans, Inform. Theory , vol.41 , Issue.6 , pp. 1889-1902
    • Balakirsky, V.B.1


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