One family of algebraic codes for network coding

Authors:
Martin Bossert;Ernst M. Gabidulin
Affiliations:
Insitute of Telecommunications and Applied Information Theory, University of Ulm, Ulm, Germany;Department of Radio Engineering, Moscow Institute of Physics and Technology, Dolgoprudny, Russia
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Year:
2009

Citing 6
Cited 0

A Fast Matrix Decoding Algorithm for Rank-Error-Correcting Codes

Proceedings of the First French-Soviet Workshop on Algebraic Coding
Symmetric Rank Codes

Problems of Information Transmission
Spectral approach to linear programming bounds on codes

Problems of Information Transmission
Error and erasure correcting algorithms for rank codes

Designs, Codes and Cryptography
Network information flow

IEEE Transactions on Information Theory
An information-theoretic view of network management

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.