DocumentCode :
1935961
Title :
On fast decoding of interleaved Gabidulin codes
Author :
Sidorenko, Vladimir ; Wachter-Zeh, Antonia ; Chen, Di
Author_Institution :
Inst. of Commun. Eng., Univ. of Ulm, Ulm, Germany
fYear :
2012
fDate :
5-10 Sept. 2012
Firstpage :
78
Lastpage :
83
Abstract :
Interleaving or the direct sum of L Gabidulin codes with rank distance d can be applied for random network coding. For the codes over Fqm a fast decoding algorithm is proposed correcting with high probability errors of rank up to L over L+1(d-1). The algorithm is based on fast skew-feedback shift-register synthesis and for fixed L has time complexity O(m3logm) operations in the base field Fq.
Keywords :
binary sequences; decoding; feedback; network coding; probability; random codes; direct sum interleaving; error probability; fast decoding algorithm; fast skew-feedback shift-register synthesis; interleaved L Gabidulin code; random network coding; Reed-Solomon codes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Problems of Redundancy in Information and Control Systems (RED), 2012 XIII International Symposium on
Conference_Location :
St. Petersburg
Print_ISBN :
978-1-4673-0168-8
Type :
conf
DOI :
10.1109/RED.2012.6338413
Filename :
6338413
Link To Document :
بازگشت