|
Volumn 22, Issue 4, 1996, Pages 247-256
|
Improved computational efficiency in derivation of capacity regions in network information theory
|
Author keywords
Cardinality bounds; Computational efficiency; Information theory
|
Indexed keywords
CHANNEL CAPACITY;
COMMUNICATION CHANNELS (INFORMATION THEORY);
COMPUTATIONAL METHODS;
COMPUTER NETWORKS;
ENCODING (SYMBOLS);
OPTIMIZATION;
PROBABILITY;
RANDOM PROCESSES;
AUXILLARY RANDOM VARIABLES;
CAPACITY REGIONS;
CARDINALITIES;
COMPUTATIONAL EFFICIENCY;
DIMENSIONALITY;
NETWORK INFORMATION THEORY;
PROBABILITY MASS FUNCTIONS;
UPPER BOUNDS;
INFORMATION THEORY;
|
EID: 0030189314
PISSN: 00457906
EISSN: None
Source Type: Journal
DOI: 10.1016/0045-7906(96)00004-3 Document Type: Article |
Times cited : (1)
|
References (12)
|