The [72,36] Type 11 Self Dual Codes from Hadamard Matrices
DOI:
https://doi.org/10.59120/drj.v4i1.62Keywords:
code, self-dual, Hadamard matrices, doubly even, weight enumerator, minimum distanceAbstract
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.
Metrics
Downloads
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
Published
Issue
Section
License
Copyright (c) 2001 Rowena T. Baylon-Cabrizos
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
DRJ is an open-access journal and the article's license is CC-BY-NC. This license allows others to distribute, remix, tweak, and build on the author's work, as long as they give credit to the original work. Authors retain the copyright and grant the journal/publisher non-exclusive publishing rights with the work simultaneously licensed under a https://creativecommons.org/licenses/by-nc/4.0/.
How to Cite
