Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

IMA
2009
Springer

favoriteEmaildiscussreport

132views Cryptology» more IMA 2009»

Subspace Codes

13 years 11 months ago

Download www.comm.utoronto.ca

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 brieﬂy described.

Azadeh Khaleghi, Danilo Silva, Frank R. Kschischan

Real-time Traffic

Adversarial Packet Insertions | Cryptography | Distance Measure | IMA 2009 | Subspace Codes |

claim paper

Related Content

» Construction of Large Constant Dimension Codes With a Prescribed Minimum Distance

» Simultaneous Extraction of Functional Face Subspaces

» Classes of optical orthogonal codes from arcs in root subspaces

» Subspace Subcodes of ReedSolomon Codes

» Convex Sparse Coding Subspace Learning and SemiSupervised Extensions

» Product Quantization for Nearest Neighbor Search

» Signing a Linear Subspace Signature Schemes for Network Coding

» A Linear Subspace Learning Approach via Sparse Coding

» Subspace Methods for Network Resource Reservation Coding Processes

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	IMA
Authors	Azadeh Khaleghi, Danilo Silva, Frank R. Kschischang

Comments (0)