Network coding theory: single sources
Communications and Information Theory
Average throughput with linear network coding over finite fields: the combination network case
EURASIP Journal on Wireless Communications and Networking - Advances in Error Control Coding Techniques
Path gain algebraic formulation for the scalar linear network coding problem
IEEE Transactions on Information Theory
| Hi-index | 754.90 |
It is known that for every solvable multicast network, there exists a large enough finite-field alphabet such that a scalar linear solution exists. We prove: i) every binary solvable multicast network with at most two messages has a binary scalar linear solution; ii) for more than two messages, not every binary solvable multicast network has a binary scalar linear solution; iii) a multicast network that has a solution for a given alphabet might not have a solution for all larger alphabets.