This article is cited in 16 papers

Coding Theory

Algebraic codes for network coding

E. M. Gabidulin^a, M. Bossert<sup>b

a</sup> 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.

UDC: 621.391.15

Received: 26.01.2009
Revised: 01.10.2009

 English version: Problems of Information Transmission, 2009, 45:4, 343–356

Bibliographic databases:

• 
• 
• 
•