Construction of MDS self-dual codes from orthogonal matrices
arXiv:1610.07736
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.
presented in part in the 3rd Sino-Korea International Conference on Coding Theory and Related Topics; submitted to IEEE trans. on Information Theory