Konstruksi Kode Linear Biner Optimal Kuat Berjarak Minimum 13 Dan 15

 dc.contributor.advisor Guritman, Sugi dc.contributor.advisor Aliatiningtyas, Nur dc.contributor.author Hendrawan dc.date.accessioned 2012-09-18T07:08:50Z dc.date.available 2012-09-18T07:08:50Z dc.date.issued 2012 dc.identifier.uri http://repository.ipb.ac.id/handle/123456789/57313 dc.description.abstract A linear binary code of length n over is defined as subspace of . 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. The main problem in algebra coding theory is optimizing one of parameters n, k and d. Given two that others were known. Based on Gilbert-Varshamov bound, if a [n, k, d]-code is exist and the code can not be expanded, we call it strongly optimal code. In this thesis, we construct strongly optimal code with minimum distance of 13 and 15. In constructing the code, we created a theorem and algorithm based on Gilbert-Varshamov bound, then we implement the algorithm to MAPLE programming language. Because of computational limitations, the program can only construct up to k = 9 for d = 13 and d = 15. en dc.subject binary linear codes en dc.subject Gilbert-Varshamov bound en dc.subject strongly optimal codes en dc.title The Construction of Strongly Optimal Linear Binary Codes with Minimum Distance of 13 and 15 en dc.title Konstruksi Kode Linear Biner Optimal Kuat Berjarak Minimum 13 Dan 15
﻿