General theory of information transfer: Updated
From MaRDI portal
Publication:947076
DOI10.1016/j.dam.2007.07.007zbMath1151.94010OpenAlexW1976341723WikidataQ56699665 ScholiaQ56699665MaRDI QIDQ947076
Publication date: 29 September 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.07.007
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Information theory (general) (94A15)
Related Items (6)
Secrecy results for compound wiretap channels ⋮ Identification over quantum broadcast channels ⋮ Identification via Quantum Channels ⋮ How to Read a Randomly Mixed Up Message ⋮ Search When the Lie Depends on the Target ⋮ Identification Entropy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Creating order in sequence spaces with simple machines
- Families of finite sets in which no set is covered by the union of \(r\) others
- The capacity of a channel with two senders and two receivers
- Spectrum invariancy under output approximation for full-rank discrete memoryless channels
- On the upper bound of the size of the \(r\)-cover-free families
- On the difference between asymptotically good packings and coverings
- On \(r\)-cover-free families
- Capacity bounds for identification via broadcast channels that are optimal for the determination broadcast channel
- The cutoff point for group testing
- On source coding with side information via a multiple-access channel and related problems in multi-user information theory
- General theory of information transfer
- A perspective on multiaccess channels
- Identification via channels
- Identification in the presence of feedback-a discovery of new capacity formulas
- Good codes can be produced by a few permutations
- On identification via multiway channels with feedback
- New results in the theory of identification via channels
- Random coding theorems for the general discrete memoryless broadcast channel
- An achievable rate region for the broadcast channel
- The Wire-Tap Channel
- Every bad code has a good subcode: A local converse to the coding theorem
- General broadcast channels with degraded message sets
- Elimination of correlation in random codes for arbitrarily varying channels
- Common randomness in information theory and cryptography. I. Secret sharing
- Identification via compressed data
- Information and control: matching channels
- New converses in the theory of identification via channels
- Arbitrarily varying multiple-access channels. I. Ericson's symmetrizability is adequate, Gubner's conjecture is true
- Hypothesis testing with communication constraints
- New directions in the theory of identification via channels
- Erasure, list, and detection zero-error capacities for low noise and a relation to identification
- Channel capacities for list codes
- Nonrandom binary superimposed codes
- Identification for Sources
- On Identification
- Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part II
- On Concepts of Performance Parameters for Channels
- On the Foundations of Information Theory
- Definition of entropy by means of a coding problem
- Broadcast channels
- Noiseless coding of correlated information sources
- General theory of information transfer and combinatorics
This page was built for publication: General theory of information transfer: Updated
