Average Throughput with Linear Network Coding over Finite Fields: The Combination Network Case
We characterize the average linear network coding throughput, Tc avg, for the combination network with min-cut 2 over an arbitrary finite field. We also provide a network code, completely specified by the field size, achieving Tc avg for the combination network.
Main Authors: | Abbas Yongacoglu, Ali Al-Bashabsheh |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2008-05-01
|
Series: | EURASIP Journal on Wireless Communications and Networking |
Online Access: | http://dx.doi.org/10.1155/2008/329727 |
Similar Items
-
Average Throughput with Linear Network Coding over Finite Fields: The Combination Network Case
by: Al-Bashabsheh Ali, et al.
Published: (2008-01-01) -
The Average Hull Dimension of Negacyclic Codes over Finite Fields
by: Somphong Jitman, et al.
Published: (2018-08-01) -
Multiple access networks over finite fields : optimality of separation, randomness and linearity
by: Ray, Siddharth, 1979-
Published: (2005) -
Design of Linear Boolean Network Codes on Combination Networks
by: Li, Shoupei
Published: (2006) -
On divisible codes over finite fields
by: Liu, Xiaoyu
Published: (2006)