Self-orthogonal codes from equitable partitions of association schemes

DOI10.1007/S10801-021-01104-ZzbMATH Open1501.94079arXiv1903.01832OpenAlexW2920309761MaRDI QIDQ2114781FDOQ2114781

Dean Crnković, Andrea Švob, Sanja Rukavina

Publication date: 15 March 2022

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Abstract: We give a method of constructing self-orthogonal codes from equitable partitions of association schemes. By applying this method we construct self-orthogonal codes from some distance-regular graphs. Some of the obtained codes are optimal. Further, we introduce a notion of self-orthogonal subspace codes. We show that under some conditions equitable partitions of association schemes yield such self-orthogonal subspace codes and we give some examples from distance-regular graphs.

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

Recommendations

• Codes from orbit matrices of strongly regular graphs
• Self-orthogonal codes from row orbit matrices of strongly regular graphs
• Self-orthogonal codes from the strongly regular graphs on up to 40 vertices
• Self-orthogonal codes from orbit matrices of 2-designs
• Construction of self-orthogonal codes from combinatorial designs

zbMATH Keywords

association schemeequitable partitionself-orthogonal codesubspace code

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Linear codes (general theory) (94B05) Group actions on combinatorial structures (05E18) Other types of codes (94B60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Searching for linear codes with large minimum distance
• Self-orthogonal codes from symmetric designs with fixed-point-free automorphisms
• Self-orthogonal codes from orbit matrices of 2-designs
• Fundamentals of Error-Correcting Codes
• Coding for Errors and Erasures in Random Network Coding
• Self-dual codes and invariant theory
• Self-orthogonal codes from the strongly regular graphs on up to 40 vertices
• Quotients of association schemes
• Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
• Network coding and subspace designs
• On some transitive combinatorial structures and codes constructed from the symplectic group \(S(6,2)\)

Cited In (8)

• Self-orthogonal codes from equitable partitions of distance-regular graphs
• LCD subspace codes
• Linear codes and cyclic codes over finite rings and their generalizations: a survey
• Siamese objects, and their relation to color graphs, association schemes and Steiner designs
• A remark on association schemes with two P-polynomial structures
• LCD codes from equitable partitions of association schemes
• Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications
• Self-orthogonal codes from Deza graphs, normally regular digraphs and Deza digraphs

Uses Software

• GAP
• Magma
• SageMath
• Code Tables

This page was built for publication: Self-orthogonal codes from equitable partitions of association schemes

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