Self-orthogonal codes from equitable partitions of association schemes
From MaRDI portal
Publication:2114781
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.
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
Cites work
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
- Coding for Errors and Erasures in Random Network Coding
- Fundamentals of Error-Correcting Codes
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 1263393 (Why is no real title available?)
- Network coding and subspace designs
- On some transitive combinatorial structures and codes constructed from the symplectic group S(6,2)
- Quotients of association schemes
- Searching for linear codes with large minimum distance
- Self-dual codes and invariant theory
- Self-orthogonal codes from orbit matrices of 2-designs
- Self-orthogonal codes from symmetric designs with fixed-point-free automorphisms
- Self-orthogonal codes from the strongly regular graphs on up to 40 vertices
Cited in
(12)- Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications
- Self-dual codes from 3-class association schemes
- Siamese objects, and their relation to color graphs, association schemes and Steiner designs
- LCD subspace codes
- LCD codes from equitable partitions of association schemes
- Linear codes and cyclic codes over finite rings and their generalizations: a survey
- Self-orthogonal codes from Deza graphs, normally regular digraphs and Deza digraphs
- Self-orthogonal codes from equitable partitions of distance-regular graphs
- Constructions of self-orthogonal and LCD subspace codes
- Matrix-product constructions for Galois self-orthogonal codes and new quantum codes
- (2p + 1)-class association schemes from the generalized Maiorana-McFarland class
- A remark on association schemes with two P-polynomial structures
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)
