메뉴 건너뛰기




Volumn , Issue , 2008, Pages 220-224

Universal fingerprinting: Capacity and random-coding exponents

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT-COMPOSITION; ERROR EXPONENTS; INTERNATIONAL SYMPOSIUM; PENALTY TERM; RANDOM CODING; RANDOMIZED SEQUENCE; TIME-SHARING; TUNABLE PARAMETERS; USEFUL PROPERTIES;

EID: 52349091655     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4594980     Document Type: Conference Paper
Times cited : (23)

References (12)
  • 1
    • 0037353686 scopus 로고    scopus 로고
    • Information-theoretic analysis of information hiding
    • March
    • P. Moulin and J. A. O'Sullivan, "Information-theoretic analysis of information hiding," IEEE Trans. on Information Theory, Vol. 49, No. 3, pp. 563-593, March 2003.
    • (2003) IEEE Trans. on Information Theory , vol.49 , Issue.3 , pp. 563-593
    • Moulin, P.1    O'Sullivan, J.A.2
  • 2
    • 15044340426 scopus 로고    scopus 로고
    • On the capacity game of private fingerprinting systems under collusion attacks
    • Mar
    • A. Somekh-Baruch and N. Merhav, "On the capacity game of private fingerprinting systems under collusion attacks," IEEE Trans. Information Theory, vol. 51, no. 3, pp. 884-899, Mar. 2005.
    • (2005) IEEE Trans. Information Theory , vol.51 , Issue.3 , pp. 884-899
    • Somekh-Baruch, A.1    Merhav, N.2
  • 3
    • 34248357288 scopus 로고    scopus 로고
    • Achievable error exponents for the private fingerprinting game
    • May
    • A. Somekh-Baruch and N. Merhav, "Achievable error exponents for the private fingerprinting game," IEEE Trans. Information Theory, Vol. 53, No. 5, pp. 1827-1838, May 2007.
    • (2007) IEEE Trans. Information Theory , vol.53 , Issue.5 , pp. 1827-1838
    • Somekh-Baruch, A.1    Merhav, N.2
  • 5
    • 0001039461 scopus 로고
    • Collusion-Secure Fingerprinting for Digital Data
    • Springer-Verlag, New York
    • D. Boneh and J. Shaw, "Collusion-Secure Fingerprinting for Digital Data," in Advances in Cryptology: Proc. CRYPTO'95, Springer-Verlag, New York, 1995.
    • (1995) Advances in Cryptology: Proc. CRYPTO'95
    • Boneh, D.1    Shaw, J.2
  • 6
    • 0038447029 scopus 로고    scopus 로고
    • Optimal Probabilistic Fingerprinting Codes
    • G. Tardos, "Optimal Probabilistic Fingerprinting Codes," STOC, 2003.
    • (2003) STOC
    • Tardos, G.1
  • 7
    • 51649124294 scopus 로고    scopus 로고
    • N. P. Anthapadmanabhan, A. Barg and I. Dumer, On the Fingerprinting Capacity Under the Marking Assumption, submitted to IEEE Trans. Information Theory, arXiv:cs/0612073v2, July 2007.
    • N. P. Anthapadmanabhan, A. Barg and I. Dumer, "On the Fingerprinting Capacity Under the Marking Assumption," submitted to IEEE Trans. Information Theory, arXiv:cs/0612073v2, July 2007.
  • 8
    • 70449470624 scopus 로고    scopus 로고
    • Universal Fingerprinting: Capacity and Random-Coding Exponents
    • arXiv:0801.3837, Jan
    • P. Moulin, "Universal Fingerprinting: Capacity and Random-Coding Exponents," preprint, arXiv:0801.3837, Jan. 2008.
    • (2008) preprint
    • Moulin, P.1
  • 9
    • 0030105189 scopus 로고    scopus 로고
    • A new universal random coding bound for the multiple-access channel
    • Mar
    • Y.-S. Liu and B. L. Hughes, "A new universal random coding bound for the multiple-access channel," IEEE Trans. Information Theory, vol. 42, no. 2, pp. 376-386, Mar. 1996.
    • (1996) IEEE Trans. Information Theory , vol.42 , Issue.2 , pp. 376-386
    • Liu, Y.-S.1    Hughes, B.L.2
  • 10
    • 84934904905 scopus 로고
    • Exponential Error Bounds for Erasure, List, and Decision Feedback Schemes
    • G. D. Forney, Jr., "Exponential Error Bounds for Erasure, List, and Decision Feedback Schemes," IEEE Trans. Information Theory, Vol. 14, No. 2, pp. 206-220, 1968.
    • (1968) IEEE Trans. Information Theory , vol.14 , Issue.2 , pp. 206-220
    • Forney Jr., G.D.1
  • 12
    • 0036163496 scopus 로고    scopus 로고
    • Capacities of Time-Varying Multiple-Access Channels With Side Information
    • Jan
    • A. Das and P. Narayan, "Capacities of Time-Varying Multiple-Access Channels With Side Information," IEEE Trans. Information Theory, Vol. 48, No. 1, pp. 4-25, Jan. 2002.
    • (2002) IEEE Trans. Information Theory , vol.48 , Issue.1 , pp. 4-25
    • Das, A.1    Narayan, P.2


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