Titlebar

Export bibliographic data
Literature by the same author
plus on the publication server
plus at Google Scholar

 

Construction of Codes for Network Coding

Title data

Elsenhans, Andreas-Stephan ; Kohnert, Axel ; Wassermann, Alfred:
Construction of Codes for Network Coding.
In: Proceedings of the 19th International Symposium on Mathematical Theory of Networks and Systems. - Budapest , 2010 . - pp. 1811-1814

Official URL: Volltext

Abstract in another language

Based on ideas of Kötter 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.

Further data

Item Type: Article in a book
Refereed: Yes
Institutions of the University: Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematics and Didactics > Chair Mathematics and Didactics - Univ.-Prof. Dr. Volker Ulm
Faculties
Faculties > Faculty of Mathematics, Physics und Computer Science
Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics
Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematics and Didactics
Result of work at the UBT: Yes
DDC Subjects: 500 Science > 510 Mathematics
Date Deposited: 27 Aug 2015 06:00
Last Modified: 27 Aug 2015 06:00
URI: https://eref.uni-bayreuth.de/id/eprint/18267