Using Rank-Metric Codes for Error Correction in Random Network Coding

2007 ◽  
Author(s):  
Danilo Silva ◽  
Frank R. Kschischang
Keyword(s):  
Error Correction ◽  
Network Coding ◽  
Random Network ◽  
Random Network Coding ◽  
Rank Metric ◽  
Rank Metric Codes

scholarly journals A Rank-Metric Approach to Error Control in Random Network Coding

2008 ◽  
Vol 54 (9) ◽  
pp. 3951-3967 ◽  
Author(s):  
Danilo Silva ◽  
Frank R. Kschischang ◽  
Ralf Koetter
Keyword(s):  
Network Coding ◽  
Error Control ◽  
Random Network ◽  
Random Network Coding ◽  
Rank Metric

scholarly journals Convolutional Codes in Rank Metric With Application to Random Network Coding

2015 ◽  
Vol 61 (6) ◽  
pp. 3199-3213 ◽  
Author(s):  
Antonia Wachter-Zeh ◽  
Markus Stinner ◽  
Vladimir Sidorenko
Keyword(s):  
Network Coding ◽  
Random Network ◽  
Convolutional Codes ◽  
Random Network Coding ◽  
Rank Metric

Subspace code based on flats in affine space over finite fields

2018 ◽  
Vol 10 (06) ◽  
pp. 1850078
Author(s):  
Min-Yao Niu ◽  
Gang Wang ◽  
You Gao ◽  
Fang-Wei Fu
Keyword(s):  
Error Correction ◽  
Network Coding ◽  
Finite Fields ◽  
Affine Space ◽  
Random Network ◽  
Sphere Packing ◽  
Random Network Coding

Subspace code is very useful in the error correction for random network coding. In this paper, subspace code based on flats in affine space over finite fields is constructed. Sphere-packing bound, Wang–Xing–Safavi-Naini bound, anticode bound, Ahlswede–Aydinian bound and Gilbert–Varshamov bound for the size of code based on flats in affine space over finite fields are provided. Finally, we introduce another method of obtaining the anticode bound for the size of code based on flats in affine space from Erdős–Ko–Rado theorem.

Sign in / Sign up

Export Citation Format

Share Document