On Circular-shift Linear Solvability of Multicast Networks

Circular-shift linear network coding (LNC) is a class of LNC schemes with low coding complexities. However, there are explicit multicast networks whose capacities cannot be achieved by circular-shift LNC. In this work, we first extend the formulation of circular-shift LNC from over GF(2) to over GF(p), where p is an arbitrary prime. Then, in terms of scalar linear solvability, we characterize an e...