The [72,36] Type 11 Self Dual Codes from Hadamard Matrices
Authors
Abstract
Consider a code [n,k,d] of length n, dimension k and of minimum distance d. Let R be a rate defined by the equation R = k/n. Mathematically, the main problem of coding theory is to find codes with large R (for efficiency) and large d (to correct many errors). This paper diseuses the binary [72,36] code constructed from Hadamard matrices.
Keywords
Statistics
#62Daily PDF views over the last 30 days (2026-10-14 — 2026-11-13).
References
Dougherty, S.T., T.A. Gulliver and M. Harada. 1997. External Binary Self Dual Codes. IEEE Trans. on Info. Theory. 43(6):2,036-2.
Downloads
License
Copyright (c) 2001 Rowena T. Baylon-Cabrizos
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
How to Cite
CrossMark Verification
Click to verify publication updates, corrections, or stewardship record for 10.59120/drj.v4i1.62.