2026-09-20T04:04:36Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/46663 2023-07-11 col_2142_5131 col_2142_8888 com_2142_5130 com_2142_8887 com_2142_234

Moulin, Pierre Moulin, Pierre Basar, Tamer Hajek, Bruce Veeravalli, Venugopal V. Milenkovic, Olgica Huang, Yen-Wei 2014-01-16T17:58:05Z 2014-01-16T17:58:05Z 2013-12 2014-01-16T17:58:05Z 2013-12 This dissertation studies the asymptotics of two multi-user channel problems. The fingerprinting channel is associated with digital fingerprinting, which is an emerging technology to protect multimedia from unauthorized redistribution. The encoder embeds fingerprints into a host sequence and provides the decoder with the capability to trace back pirated copies to the colluders. The multiple access channel (MAC) is a classical problem in the field of network information theory. Multiple senders cooperate with one another to maximize their rates of communication to a single receiver. We address the problem of asymptotic analysis when the size of the problem goes to infinity. The fundamental metric of measuring the detection capability of a fingerprinting system is capacity. It has recently been derived as the limit value of a sequence of maximin games with mutual information as their payoff functions. However, these games generally do not admit saddle-point solutions and are very hard to solve. Here under a modified version of the combined digit model proposed by Skoric et al., we reformulate the capacity as the value of a single two-person zero-sum game, and show that it is achieved by a saddle-point solution. For fingerprinting capacity games with k pirates, we provide capacities along with optimal strategies for both players of the game when k is small. For large k, we show that capacity is asymptotic to A/k^2 where the constant A is specified as the maximin value of a continuous functional game. Saddle-point solutions to the game are obtained using methods of variational calculus. For multiple access channels we study the maximum achievable rate region for a given blocklength n and a desired error probability epsilon. The inner region for the discrete memoryless MAC is approximated by a single-lettered expression I-(1/sqrt(n))*Q_inv(V,epsilon) where I is associated with the capacity pentagon bounds by Ahlswede and Liao, V is the MAC dispersion matrix, and Q_inv is the inverse complementary multivariate Gaussian cumulative distribution region. For outer regions, we provide general converse bounds for both average error probability and maximal error probability criteria. Item withdrawn by Laura Spradlin (lspradl2@illinois.edu) on 2013-11-14T15:15:37Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Huang_Yen-Wei.pdf: 954978 bytes, checksum: fb0aeb438853d5ad339cecaeb4389631 (MD5) Made available in DSpace on 2014-01-16T17:58:05Z (GMT). No. of bitstreams: 2 Yen-Wei_Huang.pdf: 954978 bytes, checksum: fb0aeb438853d5ad339cecaeb4389631 (MD5) license.txt: 4062 bytes, checksum: db541c38704ee21e0e64a37de2ff9aa2 (MD5) http://hdl.handle.net/2142/46663 en Copyright 2013 Yen-Wei Huang Multi-User Channel Fingerprinting Traitor Tracing Game Theory Minimax Analysis Asymptotic Analysis Multiple Access Channel Finite Blocklength Coding Asymptotic analysis for multi-user channels text Electrical & Computer Eng 1933 Electrical & Computer Engr 1200 University of Illinois at Urbana-Champaign Dissertation Ph.D. PHD:Electr & Computer Eng-UIUC 10KS1200PHD