|
Volumn , Issue , 2011, Pages
|
Rank distribution analysis for sparse random linear network coding
|
Author keywords
Constant dimension code; rank analysis; sparse random linear combinations; zero pattern
|
Indexed keywords
BOUNDED DISTANCE DECODING;
COMBINATORICS;
CONSTANT DIMENSION CODE;
DECODING FAILURE;
DISTRIBUTION ANALYSIS;
FINITE FIELDS;
INDEPENDENTLY AND IDENTICALLY DISTRIBUTED;
LINEAR COMBINATIONS;
MATRIX;
NETWORK RESOURCE;
NETWORK TRANSFERS;
PROBABILISTIC NETWORK;
RANDOM MATRIX;
RANDOM TRANSFER;
RANK ANALYSIS;
SUBSPACE CODES;
UPPER AND LOWER BOUNDS;
ZERO PATTERNS;
DECODING;
FINITE ELEMENT METHOD;
INFORMATION THEORY;
LINEAR NETWORKS;
PROBABILITY DISTRIBUTIONS;
TRANSFER MATRIX METHOD;
NETWORK CODING;
|
EID: 80052972595
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/ISNETCOD.2011.5978939 Document Type: Conference Paper |
Times cited : (16)
|
References (10)
|