Upper bounds for the failure probability of random linear network coding for multicast network

IET Networks ◽  
2013 ◽  
Vol 2 (4) ◽  
pp. 181-187 ◽  
Author(s):  
Hongyu Han ◽  
Daiyuan Peng ◽  
Lian Wang
Keyword(s):  
Network Coding ◽  
Failure Probability ◽  
Upper Bounds ◽  
Linear Network ◽  
Linear Network Coding ◽  
Random Linear Network Coding

scholarly journals Johnson Type Bounds for Mixed Dimension Subspace Codes

10.37236/8188 ◽  
2019 ◽  
Vol 26 (3) ◽  
Author(s):  
Thomas Honold ◽  
Michael Kiermaier ◽  
Sascha Kurz
Keyword(s):  
Network Coding ◽  
Upper Bounds ◽  
Linear Network ◽  
Subspace Codes ◽  
Linear Network Coding ◽  
Constant Dimension ◽  
Random Linear Network Coding ◽  
Johnson Bound ◽  
Constant Dimension Codes ◽  
Mixed Dimension

Subspace codes, i.e., sets of subspaces of $\mathbb{F}_q^v$, are applied in random linear network coding. Here we give improved upper bounds for their cardinalities based on the Johnson bound for constant dimension codes.

scholarly journals Exact Decoding Probability Under Random Linear Network Coding

2011 ◽  
Vol 15 (1) ◽  
pp. 67-69 ◽  
Author(s):  
Oscar Trullols-Cruces ◽  
Jose M. Barcelo-Ordinas ◽  
Marco Fiore
Keyword(s):  
Network Coding ◽  
Linear Network ◽  
Linear Network Coding ◽  
Random Linear Network Coding
Sign in / Sign up

Export Citation Format

Share Document