{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/46663"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/46663","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Asymptotic analysis for multi-user channels","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Huang, Yen-Wei"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Moulin, Pierre","Basar, Tamer","Hajek, Bruce","Veeravalli, Venugopal V.","Milenkovic, Olgica"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-01-16T17:58:05Z","date_published":"2014-01-16T17:58:05Z","updated_at":"2026-07-22T22:25:36Z","subjects":["Multi-User Channel","Fingerprinting","Traitor Tracing","Game Theory","Minimax Analysis","Asymptotic Analysis","Multiple Access Channel","Finite Blocklength Coding"],"languages":["en"],"rights":["Copyright 2013 Yen-Wei Huang"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/46663","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Moulin, Pierre","Basar, Tamer","Hajek, Bruce","Veeravalli, Venugopal V.","Milenkovic, Olgica"]},{"key":"dc:creator","label":"Author","values":["Huang, Yen-Wei"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-01-16T17:58:05Z","2013-12"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Multi-User Channel","Fingerprinting","Traitor Tracing","Game Theory","Minimax Analysis","Asymptotic Analysis","Multiple Access Channel","Finite Blocklength Coding"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2013 Yen-Wei Huang"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/46663"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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)"]},{"key":"dc:title","label":"Title","values":["Asymptotic analysis for multi-user channels"]}]}],"canonical_facts":{"dc:contributor":["Moulin, Pierre","Basar, Tamer","Hajek, Bruce","Veeravalli, Venugopal V.","Milenkovic, Olgica"],"dc:creator":["Huang, Yen-Wei"],"dc:date":["2014-01-16T17:58:05Z","2013-12"],"dc:description":["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)"],"dc:identifier":["http://hdl.handle.net/2142/46663"],"dc:language":["en"],"dc:rights":["Copyright 2013 Yen-Wei Huang"],"dc:subject":["Multi-User Channel","Fingerprinting","Traitor Tracing","Game Theory","Minimax Analysis","Asymptotic Analysis","Multiple Access Channel","Finite Blocklength Coding"],"dc:title":["Asymptotic analysis for multi-user channels"],"dc:type":["text"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:36Z"}