|
Problemy Peredachi Informatsii, 2009, Volume 45, Issue 4, Pages 54–68
(Mi ppi1999)
|
|
|
|
This article is cited in 15 scientific papers (total in 15 papers)
Coding Theory
Algebraic codes for network coding
E. M. Gabidulina, M. Bossertb a Moscow Institute of Physics and Technology
b University of Ulm, Germany
Abstract:
The subspace metric is an object of active research in network coding. Nevertheless, little is known on codes over this metric. In the present paper, several classes of codes over subspace metric are defined and investigated, including codes with distance 2, codes with the maximal distance, and constant-distance constant-dimension codes. Also, Gilbert-type bounds are presented.
Received: 26.01.2009 Revised: 01.10.2009
Citation:
E. M. Gabidulin, M. Bossert, “Algebraic codes for network coding”, Probl. Peredachi Inf., 45:4 (2009), 54–68; Problems Inform. Transmission, 45:4 (2009), 343–356
Linking options:
https://www.mathnet.ru/eng/ppi1999 https://www.mathnet.ru/eng/ppi/v45/i4/p54
|
|