DocumentCode
2976748
Title
One family of algebraic codes for network coding
Author
Bossert, Martin ; Gabidulin, Ernst M.
Author_Institution
Inst. of Telecommun. & Appl. Inf. Theor.-TAIT, Univ. of Ulm, Ulm, Germany
fYear
2009
fDate
June 28 2009-July 3 2009
Firstpage
2863
Lastpage
2866
Abstract
The subspace metric is a subject of intensive researche recently. Nevertheless not much is known about codes in this metric in general. In this paper, one class of subspace metric based codes is defined. This class is a generalization of a Koetter-Kshishang-Silva construction, namely, the lifting construction. Also, a quasi-Singleton bound is derived which is tighter than the Koetter-Kschischang bound for large dimensions of subspaces.
Keywords
algebraic codes; Koetter-Kschischang bound; Koetter-Kshishang-Silva construction; algebraic codes; network coding; quasiSingleton bound; subspace metric codes; Decoding; Encoding; Error correction codes; Galois fields; Information theory; Mathematical model; Network coding; Physics;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location
Seoul
Print_ISBN
978-1-4244-4312-3
Electronic_ISBN
978-1-4244-4313-0
Type
conf
DOI
10.1109/ISIT.2009.5205280
Filename
5205280
Link To Document