Reliability of Universal Decoding Based on Vector-Quantized Codewords
暂无分享,去创建一个
[1] Ertem Tuncel. Capacity/Storage Tradeoff in High-Dimensional Identification Systems , 2006, IEEE Transactions on Information Theory.
[2] Neri Merhav. Universal decoding using a noisy codebook , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).
[3] Meir Feder,et al. Universal Decoding for Channels with Memory , 1998, IEEE Trans. Inf. Theory.
[4] Neri Merhav. Universal Decoding for Arbitrary Channels Relative to a Given Class of Decoding Metrics , 2013, IEEE Transactions on Information Theory.
[5] Amos Lapidoth,et al. On the Universality of the LZ-Based Decoding Algorithm , 1998, IEEE Trans. Inf. Theory.
[6] Stark C. Draper,et al. On reliability of content identification from databases based on noisy queries , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.
[7] Robert G. Gallager,et al. The random coding bound is tight for the average code (Corresp.) , 1973, IEEE Trans. Inf. Theory.
[8] Frans M. J. Willems,et al. Biometric Security from an Information-Theoretical Perspective , 2012, Found. Trends Commun. Inf. Theory.
[9] Min Wu,et al. Modeling and analysis of content identification , 2009, 2009 IEEE International Conference on Multimedia and Expo.
[10] Stark C. Draper,et al. Upper and Lower Bounds on the Reliability of Content Identification , 2014 .
[11] Ton Kalker,et al. On the capacity of a biometrical identification system , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..
[12] Joseph A. O'Sullivan,et al. Achievable Rates for Pattern Recognition , 2005, IEEE Transactions on Information Theory.