CONSTRUCTION OF SELF-DUAL CODES OVER GF(7)
One of the main problem in Coding Theory is how to construct self-dual codes over finite fields that have the largest possible minimum distance. Kim and Lee (preprint, 2012) gives a construction method of self-dual codes over GF(q) of length 2n + 4 from a self-dual codes of length 2n, with n even...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/19151 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | One of the main problem in Coding Theory is how to construct self-dual
codes over finite fields that have the largest possible minimum distance. Kim and
Lee (preprint, 2012) gives a construction method of self-dual codes over GF(q) of
length 2n + 4 from a self-dual codes of length 2n, with n even. By using their construction
method, we constructed 39 new inequivalent self-dual [28; 14; 10] codes
over GF(7). Up to now, only one self-dual [28; 14; 10] codes known. Since the
existence of self-dual codes of length 28 over GF(7) with minimum distance > 10
is still unknown, the codes we obtained are the best codes with given parameters. |
|---|