메뉴 건너뛰기




Volumn 43, Issue 5, 1997, Pages 1707-1714

How many information bits does a decoder need about the channel statistics?

Author keywords

AEP; Channel simulation; Universal decoding

Indexed keywords

COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; DECODING; ENCODING (SYMBOLS); STATISTICS; THEOREM PROVING;

EID: 0031237541     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.623178     Document Type: Article
Times cited : (4)

References (11)
  • 3
    • 0016660286 scopus 로고
    • Nonprobabilistic mutual information without memory
    • V. D. Goppa, "Nonprobabilistic mutual information without memory," Probl. Contr. Inform. Theory, vol. 4, pp. 97-102, 1975.
    • (1975) Probl. Contr. Inform. Theory , vol.4 , pp. 97-102
    • Goppa, V.D.1
  • 6
    • 0027629235 scopus 로고
    • Universal decoding for memoryless Gaussian channels with a deterministic interference
    • July
    • N. Merhav, "Universal decoding for memoryless Gaussian channels with a deterministic interference," IEEE Trans. Inform. Theory, vol. 39, pp. 1261-1269, July 1993.
    • (1993) IEEE Trans. Inform. Theory , vol.39 , pp. 1261-1269
    • Merhav, N.1
  • 7
    • 0031191355 scopus 로고    scopus 로고
    • On the amount of statistical side information required for lossy data compression
    • July
    • N. Merhav and J. Ziv, "On the amount of statistical side information required for lossy data compression," IEEE Trans. Inform. Theory, vol. 43, pp. 1112-1121, July 1997.
    • (1997) IEEE Trans. Inform. Theory , vol.43 , pp. 1112-1121
    • Merhav, N.1    Ziv, J.2
  • 8
    • 0028425695 scopus 로고
    • Channel simulation and coding with side information
    • May
    • Y. Steinberg and S. Verdú, "Channel simulation and coding with side information," IEEE Trans. Inform. Theory, vol. 40, pp. 634-646, May 1994.
    • (1994) IEEE Trans. Inform. Theory , vol.40 , pp. 634-646
    • Steinberg, Y.1    Verdú, S.2
  • 9
    • 0028461972 scopus 로고
    • A general formula for channel capacity
    • July
    • S. Verdú and T. S. Han, "A general formula for channel capacity," IEEE Trans. Inform. Theory, vol. 40, pp. 1147-1157, July 1994.
    • (1994) IEEE Trans. Inform. Theory , vol.40 , pp. 1147-1157
    • Verdú, S.1    Han, T.S.2
  • 10
    • 0030107155 scopus 로고    scopus 로고
    • Classification with finite memory
    • Mar.
    • A. D. Wyner and J. Ziv, "Classification with finite memory," IEEE Trans. Inform. Theory, vol. 42, pp. 337-347, Mar. 1996.
    • (1996) IEEE Trans. Inform. Theory , vol.42 , pp. 337-347
    • Wyner, A.D.1    Ziv, J.2
  • 11
    • 33747472001 scopus 로고
    • Universal decoding for finite-state channels
    • July
    • J. Ziv, "Universal decoding for finite-state channels," IEEE Trans. Inform. Theory, vol. IT-31, pp. 453-460, July 1985.
    • (1985) IEEE Trans. Inform. Theory , vol.IT-31 , pp. 453-460
    • Ziv, J.1


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