Construction of Codes for Network Coding

Details Construction of Codes for Network Coding Construction of Codes for Network Coding

2010-05-17

arxiv.org/abs/1005.2839v1

Computer Science

Information Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Construction of Codes for Network Coding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Construction of Codes for Network Coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Construction of Codes for Network Coding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-297847