BibTex Citation Data :
@article{JSM7902, author = {Aurora Aini and Bambang Irawanto}, title = {Konstruksi Greedy Kode Lexicographic untuk Membangun Perluasan Kode Golay (24 12,8)}, journal = {JURNAL SAINS DAN MATEMATIKA}, volume = {19}, number = {1}, year = {2014}, keywords = {}, 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 }, pages = {31--37} url = {https://ejournal.undip.ac.id/index.php/sm/article/view/7902} }
Refworks Citation Data :
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
Last update:
Last update: 2024-12-24 07:40:22
