Construction of MDS self-dual codes from orthogonal matrices
classification
💻 cs.IT
math.IT
keywords
codesorthogonalself-dualconstructionfieldsmatricesalgorithmsalmost
read the original abstract
In this paper, we give algorithms and methods of construction of self-dual codes over finite fields using orthogonal matrices. Randomization in the orthogonal group, and code extension are the main tools. Some optimal, almost MDS, and MDS self-dual codes over both small and large prime fields are constructed.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.