LCD codes from weighing matrices

@article{Crnkovi2019LCDCF,
  title={LCD codes from weighing matrices},
  author={Dean Crnkovi{\'c} and Ronan Egan and Bernardo Gabriel Rodrigues and Andrea {\vS}vob},
  journal={Applicable Algebra in Engineering, Communication and Computing},
  year={2019},
  volume={32},
  pages={175-189}
}
Linear codes with complementary duals are linear codes whose intersection with their duals are trivial, shortly named LCD codes. In this paper we outline a construction for LCD codes over finite fields of order q using weighing matrices and their orbit matrices. The LCD codes constructed can be of any length dimension according to the choice of matrices used in their construction. As a special case, LCD codes of length 2 n and dimension n are constructed which also have the property of being… 
LCD subspace codes
TLDR
It is shown 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.
Group LCD and Group Reversible LCD Codes
LCD codes from equitable partitions of association schemes
  • Andrea Švob
  • Computer Science
    Applicable Algebra in Engineering, Communication and Computing
  • 2021

References

SHOWING 1-10 OF 32 REFERENCES
Euclidean and Hermitian LCD MDS codes
TLDR
This paper studies the problem of the existence of q-ary [n, k] LCD MDS codes and solves it for the Euclidean case, and investigates several constructions of new Euclidan and Hermitian LCD M DS codes.
Linear codes over Fq which are equivalent to LCD codes
TLDR
This paper introduces a general construction of LCD codes from any linear codes and shows that any linear code over $\mathbb F_{q} (q>3)$ is equivalent to an Euclidean LCD code and anylinear code over $q^2 ($q>2) (q >2) is equivalents to a Hermitian LCD code.
Linear Codes Over 𝔽q Are Equivalent to LCD Codes for q>3
TLDR
A general construction of LCD codes from any linear codes is introduced and it is shown that any linear code over $\mathbb F_{q} (q>3)$ is equivalent to a Euclidean LCD code and anylinear code over $q^{2}(q>2)$ (q-ary linear codes) is equivalents to a Hermitian LCD code.
The combinatorics of LCD codes: linear programming bound and orthogonal matrices
TLDR
A linear programming bound is given on the largest size of an LCD code of given length and minimum distance, which is a table of lower bounds for this combinatorial function for modest values of the parameters.
Linear codes with complementary duals
Constructions of optimal LCD codes over large finite fields
Orbit matrices of Hadamard matrices and related codes
The joint weight enumerator of an LCD code and its dual
On designs and formally self-dual codes
TLDR
This paper examines the one type of divisible [2n, n] codes which need not be self-dual and obtains a strengthening of the Assmus-Mattson theore and shows that the extremal f.s.d. even codes of lengths 10 and 18 are unique.
...
...