Paper Info
Title
Construction of Codes for Network Coding
Abstract
Based on ideas of K\"otter and Kschischang we use constant dimension subspaces as codewords in a network. We show a connection to the theory of q-analogues of a combinatorial designs, which has been studied in Braun, Kerber and Laue as a purely combinatorial object. For the construction of network codes we successfully modified methods (construction with prescribed automorphisms) originally developed for the q-analogues of a combinatorial designs. We then give a special case of that method which allows the construction of network codes with a very large ambient space and we also show how to decode such codes with a very small number of operations.
Year
Venue
Keywords
2010
Clinical Orthopaedics and Related Research
information theory,network coding,combinatorial design
Field
DocType
Volume
Linear network coding,Ambient space,Discrete mathematics,Vector space,Combinatorics,Subspace topology,Block code,Linear subspace,Linear code,Decoding methods,Mathematics
Journal
abs/1005.2
Citations 
PageRank 
References 
5
0.59
6
Authors
3
Name
Order
Citations
PageRank
Andreas-Stephan Elsenhans1196.94
Axel Kohnert211412.60
Alfred Wassermann312523.33