Finding C_{\text{NRI}}({\mathcal W}) , the Identification Capacity of the AVC {\mathcal W} , if Randomization in the Encoding Is Excluded

DOI10.1007/11889342_67MaRDI QIDQ5504244zbMATH OpenOpenAlexFDO

Authors Rudolf Ahlswede

Publication date 22 January 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11889342_67

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24)

Recommendations

• Publication:4945061
• On identification capacity of infinite alphabets or continuous-time channels
• Converse Coding Theorems for Identification via Channels
• Capacity bounds for identification via broadcast channels that are optimal for the determination broadcast channel
• Explicit construction of optimal constant-weight codes for identification via channels
• Codeword or Noise? Exact Random Coding Exponents for Joint Detection and Decoding
• On the capacity of a cascade of identical discrete memoryless nonsingular channels (Corresp.)
• Erasure, list, and detection zero-error capacities for low noise and a relation to identification
• A random coding bound for fixed convolutional codes of rate 1/n
• An achievable bound for optimal noiseless coding of a random variable (Corresp.)

This page was built for publication: Finding $C_{\text{NRI}}({\mathcal W})$ , the Identification Capacity of the AVC ${\mathcal W}$ , if Randomization in the Encoding Is Excluded

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504244)