Constructions of self-orthogonal and LCD subspace codes

DOI10.1016/J.DISC.2026.115066MaRDI QIDQ6846036zbMATH OpenFDO

Authors Dean Crnković, Keita Ishizuka, H. Kharaghani, Sho Suda, Andrea Švob

Publication date 12 March 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115066

zbMATH Keywords

Deza graphHadamard matrixLCD codemutually unbiased weighing matrixself-orthogonal codesubspace code

Mathematics Subject Classification ID

Algebraic combinatorics (05Exx) Theory of error-correcting codes and error-detecting codes (94Bxx)

Cites work

• A Random Linear Network Coding Approach to Multicast
• A Rank-Metric Approach to Error Control in Random Network Coding
• A stability result and a spectrum result on constant dimension codes
• Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
• Coding for Errors and Erasures in Random Network Coding
• Divisible design graphs
• Fundamentals of Error-Correcting Codes
• Further constructions of cyclic subspace codes
• Hoffman's coclique bound for normal regular digraphs, and nonsymmetric association schemes
• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 140063 (Why is no real title available?)
• Improvement to the sunflower bound for a class of equidistant constant dimension subspace codes
• LCD subspace codes
• Linear codes with complementary duals
• Linked systems of symmetric group divisible designs
• Linked systems of symmetric group divisible designs of type. II
• Mutually unbiased bush-type Hadamard matrices and association schemes
• Network coding and subspace designs
• Network information flow
• New constructions of Deza digraphs
• On equitable partition of matrices and its applications
• On the real unbiased Hadamard matrices
• Orbit matrices of Hadamard matrices and related codes
• Quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices: a coding-theoretic approach
• Self-orthogonal codes from Deza graphs, normally regular digraphs and Deza digraphs
• Self-orthogonal codes from equitable partitions of association schemes
• Self-orthogonal codes from symmetric designs with fixed-point-free automorphisms
• Symmetric group divisible designs with the dual property
• Unbiased orthogonal designs
• Weighing matrices and spherical codes

Cited in

(1)

• Linear complementary pairs of subspace codes

This page was built for publication: Constructions of self-orthogonal and LCD subspace codes

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