Converse coding theorems for identification via multiple access channels

No abstract is available for this paper.

• Publication year

  2013

• Venue

  2013 IEEE International Symposium on Information Theory

• Publication date

  2013-07-07

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/ISIT.2013.6620507
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Converse Coding Theorems for Identification via Channels

  2013cited by this paper
• Outer Bound of the Capacity Region for Identification via Multiple Access Channels

  2013cited by this paper
• General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel

  2006cited by this paper
• General non-asymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to wire-tap channel

  2005cited by this paper
• Information-Spectrum Methods in Information Theory

  2002cited by this paper
• Converse coding theorem for the identification via multiple access channels

  2002cited by this paper
• Identification in the presence of side information with application to watermarking

  2000cited by this paper
• On identification capacity of infinite alphabets or continuous-time channels

  2000cited by this paper
• Resolvability Theory for the Multiple-Access Channel

  1998cited by this paper
• New converses in the theory of identification via channels

  1998cited by this paper
• New directions in the theory of identification via channels

  1995cited by this paper
• Approximation Theory of Output Statistics

  1993influential reference
• New results in the theory of identification via channels

  1992cited by this paper
• On identification via multiway channels with feedback

  1991cited by this paper
• Capacity bounds for identification via broadcast channels which are optimal for the deterministic broadcast channel

  1990cited by this paper
• Multiple-access channels with memory with and without frame synchronism

  1989influential reference
• Identification via channels

  1989cited by this paper
• Identification in the presence of feedback-A discovery of new capacity formulas

  1989cited by this paper

• Channel Resolvability Using Multiplicative Weight Update Algorithm

  2025cites this paper
• The Second-Order Coding Rate of Identification via Simple-Dispersion DMCs with Feedback

  2025cites this paper
• A New Achievable Region of the K-User MAC Wiretap Channel With Confidential and Open Messages Under Strong Secrecy

  2024cites this paper
• MAC resolvability: First and second order results

  2017cites this paper
• The MAC Resolvability Region, Semantic Security and Its Operational Implications

  2017cites this paper