LCD subspace codes (Q6074021)

Linear codes with complementary duals, shortly named LCD codes, are linear codes whose intersection with their duals is trivial. They were introduced by \textit{J. L. Massey} [Discrete Math. 106/107, 337--342 (1992; Zbl 0754.94009)] who showed that the nearest-codeword (or maximum-likelihood) decoding problem for an LCD code may be simpler than that for a general linear code. Subspace codes on the other hand were introduced by \textit{R. Koetter} and \textit{F. R. Kschischang} [IEEE Trans. Inf. Theory 54, No. 8, 3579--3591 (2008; Zbl 1318.94111)] when they developed the idea of random network coding. In this paper, the two concepts are combined in the new notion of LCD subspace codes as an analogue of the original LCD linear codes. They are defined as subspace codes for which all of the orthogonal complements have empty intersection with the original subspaces. In particular, every codeword itself (being a subspace) defines an LCD code. The authors give some methods to construct these codes, starting from association schemes and certain equitable partitions, and from mutually unbiased weighing matrices, which generalize Hadamard matrices. Small examples of each class are provided throughout.