23 research outputs found
Message Encoding for Spread and Orbit Codes
Spread codes and orbit codes are special families of constant dimension
subspace codes. These codes have been well-studied for their error correction
capability and transmission rate, but the question of how to encode messages
has not been investigated. In this work we show how the message space can be
chosen for a given code and how message en- and decoding can be done.Comment: Submitted to IEEE International Symposium on Information Theory 201
New Lower Bounds for Constant Dimension Codes
This paper provides new constructive lower bounds for constant dimension
codes, using different techniques such as Ferrers diagram rank metric codes and
pending blocks. Constructions for two families of parameters of constant
dimension codes are presented. The examples of codes obtained by these
constructions are the largest known constant dimension codes for the given
parameters
Optimal Ferrers Diagram Rank-Metric Codes
Optimal rank-metric codes in Ferrers diagrams are considered. Such codes
consist of matrices having zeros at certain fixed positions and can be used to
construct good codes in the projective space. Four techniques and constructions
of Ferrers diagram rank-metric codes are presented, each providing optimal
codes for different diagrams and parameters.Comment: to be presented in Algebra, Codes, and Networks, Bordeaux, June 16 -
20, 201