Subspace Codes

  • Azadeh Khaleghi
  • Danilo Silva
  • Frank R. Kschischang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5921)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Azadeh Khaleghi
    • 1
  • Danilo Silva
    • 1
  • Frank R. Kschischang
    • 1
  1. 1.Department of Electrical and Computer EngineeringUniversity of TorontoTorontoCanada

Personalised recommendations