Construction of MDS self-dual codes from orthogonal matrices
Information Theory
2016-10-26 v1 math.IT
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.
Cite
@article{arxiv.1610.07736,
title = {Construction of MDS self-dual codes from orthogonal matrices},
author = {Minjia Shi and Lin Sok and Patrick Solé},
journal= {arXiv preprint arXiv:1610.07736},
year = {2016}
}
Comments
presented in part in the 3rd Sino-Korea International Conference on Coding Theory and Related Topics; submitted to IEEE trans. on Information Theory