General theory of information transfer: Updated
type: Item
instance of: scholarly article
title: General theory of information transfer: Updated
zbMATH Open document ID: 1151.94010
published in: Discrete Applied Mathematics
publication date: 2008-09-29T00:00:00Z
Mathematics Subject Classification ID: 94A15
Mathematics Subject Classification ID: 94-02
zbMATH DE Number: 5348207
zbMATH Keywords: survey
zbMATH Keywords: information theory
zbMATH Keywords: identification
zbMATH Keywords: data compression
MaRDI profile type: Publication
full work available at URL: j.dam.2007.07.007
OpenAlex ID: W1976341723
Wikidata QID: Q56699665
cites work: Q4404773
cites work: Channel capacities for list codes
cites work: The capacity of a channel with two senders and two receivers
cites work: Elimination of correlation in random codes for arbitrarily varying channels
cites work: Q4191951
cites work: General theory of information transfer
cites work: On Concepts of Performance Parameters for Channels
cites work: Identification for Sources
cites work: Information and control: matching channels
cites work: Arbitrarily varying multiple-access channels. I. Ericson's symmetrizability is adequate, Gubner's conjecture is true
cites work: Q4945061
cites work: Erasure, list, and detection zero-error capacities for low noise and a relation to identification
cites work: Hypothesis testing with communication constraints
cites work: Common randomness in information theory and cryptography. I. Secret sharing
cites work: Every bad code has a good subcode: A local converse to the coding theorem
cites work: Good codes can be produced by a few permutations
cites work: Identification via channels
cites work: Identification in the presence of feedback-a discovery of new capacity formulas
cites work: Q4132117
cites work: On source coding with side information via a multiple-access channel and related problems in multi-user information theory
cites work: Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part II
cites work: On identification via multiway channels with feedback
cites work: Identification via compressed data
cites work: Creating order in sequence spaces with simple machines
cites work: New directions in the theory of identification via channels
cites work: General theory of information transfer and combinatorics
cites work: Q5598243
cites work: Definition of entropy by means of a coding problem
cites work: Q3251782
cites work: Broadcast channels
cites work: An achievable rate region for the broadcast channel
cites work: Q3686615
cites work: Q4745752
cites work: Families of finite sets in which no set is covered by the union of \(r\) others
cites work: On \(r\)-cover-free families
cites work: A perspective on multiaccess channels
cites work: Q4779829
cites work: New results in the theory of identification via channels
cites work: Spectrum invariancy under output approximation for full-rank discrete memoryless channels
cites work: Nonrandom binary superimposed codes
cites work: On Identification
cites work: General broadcast channels with degraded message sets
cites work: On the difference between asymptotically good packings and coverings
cites work: Q4529547
cites work: Q4077127
cites work: Q4174621
cites work: On the Foundations of Information Theory
cites work: On the upper bound of the size of the \(r\)-cover-free families
cites work: A Mathematical Theory of Communication
cites work: Q3291932
cites work: Q5548056
cites work: Noiseless coding of correlated information sources
cites work: New converses in the theory of identification via channels
cites work: The cutoff point for group testing
cites work: Random coding theorems for the general discrete memoryless broadcast channel
cites work: Capacity bounds for identification via broadcast channels that are optimal for the determination broadcast channel
cites work: Q3254789
cites work: The Wire-Tap Channel
DBLP publication ID: journals/dam/Ahlswede08a
DOI: 10.1016/J.DAM.2007.07.007
author: Rudolf Ahlswede
description: scientific article; zbMATH DE number 5348207