LCD subspace codes

DOI10.1007/S10623-023-01251-3MaRDI QIDQ6074021zbMATH OpenFDO

Publication date 12 October 2023

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2204.08552

association scheme equitable partition LCD code mutually unbiased Hadamard matrices subspace code

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Association schemes, strongly regular graphs (05E30) Linear codes (general theory) (94B05)

Abstract: A subspace code is a nonempty set of subspaces of a vector space

m a t h b b F_{q}^{n}

. Linear codes with complementary duals, or LCD codes, are linear codes whose intersection with their duals is trivial. In this paper, we introduce a notion of LCD subspace codes. We show that the minimum distance decoding problem for an LCD subspace code reduces to a problem that is simpler than for a general subspace code. Further, we show that under some conditions equitable partitions of association schemes yield such LCD subspace codes and as an illustration of the method give some examples from distance-regular graphs. We also give a construction from mutually unbiased Hadamard matrices, and more generally, from mutually unbiased weighing matrices.

Review text

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.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: LCD subspace codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074021)