Construction of MDS self-dual codes from orthogonal matrices

2016/10/25 by Minjia Shi, Shi, Minjia, Lin Sok +3
Computer Science · Engineering · #Coding theory and cryptography #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1610.07736

openalex publication_date 2016/10/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• A new upper bound on the minimal distance of self-dual codes

Related

• Construction of MDS Self-dual Codes over Finite Fields
• Construction of optimal Hermitian self-dual codes from unitary matrices
• New MDS self-dual codes over finite fields \F_r²
• An Unified Approach on Constructing of MDS Self-dual Codes via Reed-Solomon Codes
• Construction of MDS self-dual codes from generalized Reed-Solomon codes