Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : SAINS DAN MATEMATIKA

Konstruksi Greedy Kode Lexicographic untuk Membangun Perluasan Kode Golay (24 12,8) Aini, Aurora Nur; Irawanto, Bambang
JURNAL SAINS DAN MATEMATIKA Volume 19 Issue 1 Year 2011
Publisher : JURNAL SAINS DAN MATEMATIKA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (3788.437 KB)

Abstract

Golay codes can be constructed by lexicographic codes. Lexicographic codes constructed by Greedy algorithm. Greedy construction is one type of Greedy algorithm. Given codes with minimum distance d and length n. To construct the greedy algorithm, the codeword with length n are processed in some fixed order, and the next codeword is inserted in the code when its distance from all codewords previously selected is  d. On Greedy construction, to set (n, k,d) codes, we only need to set (n-k,k) codes with  k iteration.   Keywords: linear codes, lexicographic codes, Golay, generator matrix