Construction of Large Constant Dimension Codes With a Prescribed Minimum Distance

Simple item page
dc.creatorKohnert, Axel
dc.creatorKurz, Sascha
dc.date2008-07-21
dc.date.accessioned2026-07-07T12:28:12Z
dc.date.available2026-07-07T12:28:12Z
dc.descriptionIn this paper we construct constant dimension space codes with prescribed minimum distance. There is an increased interest in space codes since a paper by Koetter and Kschischang were they gave an application in network coding. There is also a connection to the theory of designs over finite fields. We will modify a method of Braun, Kerber and Laue which they used for the construction of designs over finite fields to do the construction of space codes. Using this approach we found many new constant dimension spaces codes with a larger number of codewords than previously known codes. We will finally give a table of the best found constant dimension space codes.
dc.description13 pages, 1 figure, 1 table, submitted
dc.identifierhttps://arxiv.org/abs/0807.3212
dc.identifierhttp://arxiv.org/abs/0807.3212
dc.identifierLecture Notes Computer Science Vol. 5393, 2008, p. 31 - 42
dc.identifierdoi:10.1007/978-3-540-89994-5_4
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/215464
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.subjectCombinatorics
dc.titleConstruction of Large Constant Dimension Codes With a Prescribed Minimum Distance
dc.typetext

Files

Collections

arXiv