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 subspace code mutually unbiased Hadamard matrices

Association schemes, strongly regular graphs (05E30) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) 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.

Recommendations

Cites work

Cited in

(6)

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)