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 |
| id |
id-itb.:19151 |
|---|---|
| spelling |
id-itb.:191512017-09-27T11:43:11ZCONSTRUCTION OF SELF-DUAL CODES OVER GF(7) ARIESTYADI, PRATIKTO Indonesia Final Project Self-dual codes, mass formula, weight enumerator INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/19151 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. text |
| institution |
Institut Teknologi Bandung |
| building |
Institut Teknologi Bandung Library |
| continent |
Asia |
| country |
Indonesia Indonesia |
| content_provider |
Institut Teknologi Bandung |
| collection |
Digital ITB |
| language |
Indonesia |
| description |
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. |
| format |
Final Project |
| author |
ARIESTYADI, PRATIKTO |
| spellingShingle |
ARIESTYADI, PRATIKTO CONSTRUCTION OF SELF-DUAL CODES OVER GF(7) |
| author_facet |
ARIESTYADI, PRATIKTO |
| author_sort |
ARIESTYADI, PRATIKTO |
| title |
CONSTRUCTION OF SELF-DUAL CODES OVER GF(7) |
| title_short |
CONSTRUCTION OF SELF-DUAL CODES OVER GF(7) |
| title_full |
CONSTRUCTION OF SELF-DUAL CODES OVER GF(7) |
| title_fullStr |
CONSTRUCTION OF SELF-DUAL CODES OVER GF(7) |
| title_full_unstemmed |
CONSTRUCTION OF SELF-DUAL CODES OVER GF(7) |
| title_sort |
construction of self-dual codes over gf(7) |
| url |
https://digilib.itb.ac.id/gdl/view/19151 |
| _version_ |
1821119748890427392 |