KONSTRUKSI LEXICOGRAPHIC UNTUK MEMBANGUN KODE HAMMING (7, 4, 3)

Aini, Aurora Nur and IRAWANTO, BAMBANG (2009) KONSTRUKSI LEXICOGRAPHIC UNTUK MEMBANGUN KODE HAMMING (7, 4, 3). Jurnal Matematika, 12 (3). pp. 154-164. ISSN 1410-8518

[img]HTML
2833Kb
[img]
Preview
PDF
328Kb

Abstract

Hamming code can correct single error in massages transmission. Hamming codes can be constructed by Lexicographic codes. Lexicographic construction is a greedy algorithm that produces error correcting codes known as lexicographic codes. There are two ways to construct lexicographic codes. They are greedy construction and lexicographic constructions. 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. The Lexicographic Construction is a different approach with a goal to speed up the process of generating lexicodes by storing the reusable information in the memory.

Item Type:Article
Subjects:Q Science > QA Mathematics
Divisions:Faculty of Science and Mathematics > Department of Mathematics
ID Code:26864
Deposited By:Ms Niken P
Deposited On:19 Apr 2011 15:34
Last Modified:19 Apr 2011 15:34

Repository Staff Only: item control page