Constructions of self-orthogonal and LCD subspace codes
Preprint
Abstract
Recently, the notions of self-orthogonal subspace codes and LCD subspace codes were introduced, and LCD subspace codes obtained from mutually unbiased weighing matrices were studied. In this paper, we provide a method of constructing self-orthogonal and LCD subspace codes from a set of matrices under certain conditions. In particular, we give constructions of self-orthogonal and LCD subspace codes from mutually quasi-unbiased weighing matrices, linked systems of symmetric designs, and linked systems of symmetric group divisible designs, Deza graphs and their equitable partitions.Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Self-Orthogonal Codes from Deza Graphs, Normally Regular Digraphs and Deza DigraphsGraphs and Combinatorics, 2024
- LCD subspace codesDesigns, Codes and Cryptography, 2023
- Self-orthogonal codes from equitable partitions of association schemesJournal of Algebraic Combinatorics, 2022
- Improvement to the sunflower bound for a class of equidistant constant dimension subspace codesJournal of Geometry, 2021
- Linked systems of symmetric group divisible designs of type IIDesigns, Codes and Cryptography, 2019
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6Designs, Codes and Cryptography, 2018
- Unbiased orthogonal designsDesigns, Codes and Cryptography, 2017
- Linked systems of symmetric group divisible designsJournal of Algebraic Combinatorics, 2017
- Hoffman’s Coclique Bound for Normal Regular Digraphs, and Nonsymmetric Association SchemesSpringer Proceedings in Mathematics & Statistics, 2017
- Weighing matrices and spherical codesJournal of Algebraic Combinatorics, 2015