메뉴 건너뛰기




Volumn 43, Issue 1, 1997, Pages 48-70

Identification via compressed data

Author keywords

Identification with fidelity; Misacceptance and misrejection error probabilities; Multiuser information theory; Rate distortion function

Indexed keywords

DECODING; INFORMATION THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SIGNAL DISTORTION; SIGNAL ENCODING; THEOREM PROVING;

EID: 0030836077     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.567648     Document Type: Article
Times cited : (30)

References (11)
  • 1
  • 2
    • 0016576623 scopus 로고
    • Source coding with side information and a converse for degrades broadcast channels
    • R. Ahlswede and J. Körner, "Source coding with side information and a converse for degrades broadcast channels," IEEE Trans. Inform. Theory, vol. IT-21, pp. 629-637, 1975.
    • (1975) IEEE Trans. Inform. Theory , vol.IT-21 , pp. 629-637
    • Ahlswede, R.1    Körner, J.2
  • 3
    • 0000911221 scopus 로고
    • Bounds on conditional probabilities with applications in multiuser communication
    • R. Ahlswede, P. Gács, and J. Körner, "Bounds on conditional probabilities with applications in multiuser communication," Z. Wahrscheinlichkeitstheorie und verw. Geb., vol. 34, pp. 157-177, 1976.
    • (1976) Z. Wahrscheinlichkeitstheorie und Verw. Geb. , vol.34 , pp. 157-177
    • Ahlswede, R.1    Gács, P.2    Körner, J.3
  • 4
    • 0019584491 scopus 로고
    • To get a bit of information may be as hard as to get full information
    • R. Ahlswede and I. Csiszár, "To get a bit of information may be as hard as to get full information," IEEE Trans. Inform. Theory, vol. IT-27, pp. 389-408, 1981.
    • (1981) IEEE Trans. Inform. Theory , vol.IT-27 , pp. 389-408
    • Ahlswede, R.1    Csiszár, I.2
  • 7
    • 0001173412 scopus 로고
    • Optimal numbering and isoperimetric problems on graphs
    • L. H. Harper, "Optimal numbering and isoperimetric problems on graphs," J. Comb. Theory, no. 1, pp. 385-394, 1966.
    • (1966) J. Comb. Theory , Issue.1 , pp. 385-394
    • Harper, L.H.1
  • 8
    • 0001641786 scopus 로고
    • A generalization of Ornstein's d-distance with application to information theory
    • R. M. Gray, D. L. Neuhoff, and P. C. Shields, "A generalization of Ornstein's d-distance with application to information theory," Ann. Probab., vol. 3, pp. 315-328, 1975.
    • (1975) Ann. Probab. , vol.3 , pp. 315-328
    • Gray, R.M.1    Neuhoff, D.L.2    Shields, P.C.3
  • 10
    • 0000620132 scopus 로고
    • Sanov property, generalized i - Projection and conditional limit theorem
    • I. Csiszár, "Sanov property, generalized I - Projection and conditional limit theorem," Ann. Probab., no. 12, pp. 768-793, 1984.
    • (1984) Ann. Probab. , Issue.12 , pp. 768-793
    • Csiszár, I.1


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