On Perfect Codes and Related Concepts
Designs, Codes and Cryptography
Codes and anticodes in the Grassman graph
Journal of Combinatorial Theory Series A
The Discovery of Simple 7-Designs with Automorphism Group PTL (2, 32)
AAECC-11 Proceedings of the 11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Systematic construction of q-analogs of t - (v, k, λ)-designs
Designs, Codes and Cryptography
Construction of linear codes with large minimum distance
IEEE Transactions on Information Theory
Optimal linear codes from matrix groups
IEEE Transactions on Information Theory
A Heuristic Algorithm for the Construction of Good Linear Codes
IEEE Transactions on Information Theory
Coding for Errors and Erasures in Random Network Coding
IEEE Transactions on Information Theory
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
A complete characterization of irreducible cyclic orbit codes and their Plücker embedding
Designs, Codes and Cryptography
| Hi-index | 0.00 |
In this paper we construct constant dimension codes with prescribed minimum distance. There is an increased interest in subspace codes in general since a paper [13] by Kötter and Kschischang where 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 [7] which they used for the construction of designs over finite fields to construct constant dimension codes. Using this approach we found many new constant dimension codes with a larger number of codewords than previously known codes. We finally give a table of the best constant dimension codes we found.