Subspace Codes

Authors:
Azadeh Khaleghi;Danilo Silva;Frank R. Kschischang
Affiliations:
Department of Electrical and Computer Engineering, University of Toronto, Toronto, Canada M5S 3G4;Department of Electrical and Computer Engineering, University of Toronto, Toronto, Canada M5S 3G4;Department of Electrical and Computer Engineering, University of Toronto, Toronto, Canada M5S 3G4
Venue:
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Year:
2009

Citing 12
Cited 0

The Erdo¨s-Ko-Rado theorem for vector spaces

Journal of Combinatorial Theory Series A
Symbol-level network coding for wireless mesh networks

Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Johnson type bounds on constant dimension codes

Designs, Codes and Cryptography
Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance

Mathematical Methods in Computer Science
Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams

IEEE Transactions on Information Theory
Fast encoding and decoding of Gabidulin codes

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
On metrics for error correction in network coding

IEEE Transactions on Information Theory
The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction]

IEEE Transactions on Information Theory
Linear authentication codes: bounds and constructions

IEEE Transactions on Information Theory
Coding for Errors and Erasures in Random Network Coding

IEEE Transactions on Information Theory
Packing and Covering Properties of Rank Metric Codes

IEEE Transactions on Information Theory
A Rank-Metric Approach to Error Control in Random Network Coding

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is a survey of bounds and constructions for subspace codes designed for the injection metric, a distance measure that arises in the context of correcting adversarial packet insertions in linear network coding. The construction of lifted rank-metric codes is reviewed, along with improved constructions leading to codes with strictly more codewords. Algorithms for encoding and decoding are also briefly described.