作者: Niladri Das , Brijesh Kumar Rai
关键词:
摘要: Sum-networks are networks where all the terminals demand sum of symbols generated at sources. It has been shown that for any finite set/co-finite set prime numbers, there exists a sum-network which rate 1 linear network coding solution if and only characteristic field belongs to given set. also positive rational number k/n, capacity equal k/n. is natural question whether, primes {p , p 2 …, l }, achieving k/n fractional We show indeed such by giving an explicit construction.