Construction of Strongly Optimal Binary Linear Code with Minimum Distance 9 and 11
Konstruksi Kode Linear Biner Optimal Kuat Berjarak Minimum 9 dan 11
dc.contributor.advisor | Guritman, Sugi | |
dc.contributor.advisor | Mas'oed, Teduh Wulandari | |
dc.contributor.author | Hadi Utomo, Putranto | |
dc.date.accessioned | 2012-02-01T02:13:37Z | |
dc.date.available | 2012-02-01T02:13:37Z | |
dc.date.issued | 2011 | |
dc.identifier.uri | http://repository.ipb.ac.id/handle/123456789/53114 | |
dc.description.abstract | A binary linear code of length n over q F is a subspace of n q F . A code has three parameters that attached to it, namely length, dimension, and minimum distance. A code with length n, dimension k and minimum distance d is often called [n, k, d ]-code. Usually, when two parameters are given, then we want to find a code that has the best value for the last parameter. Based on Gilbert- Varshamov bound, if a [n, k, d ]-code exists and can not be expanded, we call it a strongly optimal code. In this paper, we construct strongly optimal code with minimum distance 9 and 11. In constructing the code, we created a theorem and algorithm based on Gilbert-Varshamov bound before we implement the algorithm to MAPLE programming language. Because of computational limitations, the program can only construct up to k = 10 for d = 9 and k = 12 for d = 11. | en |
dc.description.abstract | Media informasi, seperti sistem komunikasi dan media penyimpanan untuk data, tidak sepenuhnya reliabel. Hal ini dikarenakan bahwa pada praktiknya ada gangguan (noise) atau interferensi lainnya sehingga pesan yang dikirim berubah (terdapat error pada pesan). Salah satu masalah dalam teori koding (coding theory) adalah untuk mendeteksi atau bahkan mengoreksi galat (error) tersebut. Suatu kode (code) diciptakan untuk mendeteksi atau mengoreksi galat akibat saluran yang terganggu. | id |
dc.subject | binary linear code | en |
dc.subject | Gilbert Varshamov bound | en |
dc.subject | strongly optimal code | en |
dc.title | Construction of Strongly Optimal Binary Linear Code with Minimum Distance 9 and 11 | en |
dc.title | Konstruksi Kode Linear Biner Optimal Kuat Berjarak Minimum 9 dan 11 | id |