The [72,36] Type 11 Self Dual Codes from Hadamard Matrices
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] c...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Davao Oriental State University
2001-12-01
|
| Series: | Davao Research Journal |
| Subjects: | |
| Online Access: | https://davaoresearchjournal.ph/index.php/main/article/view/62 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|