The [72,36] Type 11 Self Dual Codes from Hadamard Matrices

Authors

  • Rowena T. Baylon-Cabrizos Instructor, Mathematical Sciences Department, Davao Oriental State College of Science and Technology

DOI:

https://doi.org/10.59120/drj.v4i1.62

Keywords:

code, self-dual, Hadamard matrices, doubly even, weight enumerator, minimum distance

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.

Metrics

Metrics Loading ...

Author Biography

Rowena T. Baylon-Cabrizos, Instructor, Mathematical Sciences Department, Davao Oriental State College of Science and Technology

Mati, Davao Oriental

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

2001-12-04

How to Cite

Baylon-Cabrizos, R. (2001). The [72,36] Type 11 Self Dual Codes from Hadamard Matrices. Davao Research Journal, 4(1), 56–63. https://doi.org/10.59120/drj.v4i1.62

Issue

Vol. 4 No. 1 (2001): December

Section

Articles

License

Copyright (c) 2001 Rowena T. Baylon-Cabrizos

Creative Commons License

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/.

Crossref
Scopus
Google Scholar
Europe PMC