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: | ARIESTYADI, PRATIKTO |
---|---|
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 |
Similar Items
-
s-Extremal Additive Codes over GF(4)
by: Bautista, Evangeline P, et al.
Published: (2006) -
CONSTRUCTION OF SELF DUAL CODE OVER FINITE ABELIAN GROUP
by: RHEZA SETIAWAN (NIM : 10110018), MICHAEL -
Optimal solution for the index coding problem using network coding over GF(2)
by: Qureshi, Jalaluddin, et al.
Published: (2013) -
Towards optimal edge weight distribution and construction of field-compatible low-density parity-check codes over GF(q)
by: Han, Guojun, et al.
Published: (2016) -
On self-dual cyclic codes and generalized self-dual cyclic codes over finite fields
by: Yan, Jia
Published: (2012)