Improvement of Extended Least Difference Greedy Clique-Cover Algorithm for Index Coding
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Joon-Woo | - |
dc.contributor.author | Kim, Jae-Won | - |
dc.contributor.author | No, Jong-Seon | - |
dc.date.accessioned | 2023-03-08T15:47:47Z | - |
dc.date.available | 2023-03-08T15:47:47Z | - |
dc.date.issued | 2018-10 | - |
dc.identifier.issn | 2162-1233 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/63832 | - |
dc.description.abstract | We modify the heuristic algorithm proposed by Kwak, et al., called the extended least difference greedy (ELDG) algorithm, to make it more efficient. The column-merging heuristic algorithm, which is one of the essential parts in the ELDG algorithm, is found numerically not to be efficient for reducing the index codelength; besides, the result of the column-merging heuristic algorithm can be even longer than that of the original LDG algorithm. We detect when the column-merging heuristic algorithm give worse result than the result of the original LDG algorithm. Modified slightly, the proposed column-merging heuristic algorithm becomes efficient for reducing codelength. Additionally, we add the cycle-of-p-nodes detection algorithm, which is the generalized version of the cycle-of-three-node detection algorithm in the ELDG algorithm. It is numerically shown that roughly 20% of the index codelength reduction is achieved by the proposed ELDG algorithm compared to the LDG algorithm, while the conventional ELDG algorithm shows 10% of reduction rate compared to the LDG algorithm. | - |
dc.format.extent | 3 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | IEEE | - |
dc.title | Improvement of Extended Least Difference Greedy Clique-Cover Algorithm for Index Coding | - |
dc.type | Article | - |
dc.identifier.doi | 10.1109/ICTC.2018.8539615 | - |
dc.identifier.bibliographicCitation | 2018 INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGY CONVERGENCE (ICTC), pp 818 - 820 | - |
dc.description.isOpenAccess | N | - |
dc.identifier.wosid | 000517984800172 | - |
dc.identifier.scopusid | 2-s2.0-85059475925 | - |
dc.citation.endPage | 820 | - |
dc.citation.startPage | 818 | - |
dc.citation.title | 2018 INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGY CONVERGENCE (ICTC) | - |
dc.type.docType | Proceedings Paper | - |
dc.publisher.location | 미국 | - |
dc.subject.keywordAuthor | Index code | - |
dc.subject.keywordAuthor | least difference greedy clique-cover algorithm | - |
dc.subject.keywordPlus | BROADCAST | - |
dc.subject.keywordPlus | DEMAND | - |
dc.subject.keywordPlus | ISCOD | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
84, Heukseok-ro, Dongjak-gu, Seoul, Republic of Korea (06974)02-820-6194
COPYRIGHT 2019 Chung-Ang University All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.