An Efficient Tree Search Algorithm for the Free Distance of Variable-Length Error-Correcting Codes
檔案
本條目沒有附加檔案。
日期
2018-03-01
類型
系所
期刊名稱
IEEE COMMUNICATIONS LETTERS
卷期與頁次
第 22 卷,頁 474–477
ISSN
1089-7798
語言
英文
摘要
We propose an efficient tree search algorithm for determining the free distance of variable-length error-correcting codes (VLECs). A main idea behind the algorithm is to structure all pairs of code word-concatenated sequences as a tree, in which we seek the pair of sequences that determine the free distance. In order to speed up the algorithm, we establish constraints that do not compromise optimality in determining the free distance. Experimental results on VLECs algorithmically constructed for the English alphabet show that our algorithm requires a considerably smaller number of bitwise distance computations and covers a much smaller number of tree nodes than Dijkstra's algorithm operating over the pairwise distance graph while being a hundred times faster in terms of execution time.
關鍵詞
Joint source-channel codingvariable length error-correcting codesfree distanceDijkstra's algorithm所屬典藏
期刊論文引用此條目
Huang, C., Wu, T.-Y., Chen, P.-N., Alajaji, F., & Han, Y. S. (2018). An Efficient Tree Search Algorithm for the Free Distance of Variable-Length Error-Correcting Codes. IEEE COMMUNICATIONS LETTERS, 22, 474–477. https://doi.org/10.1109/LCOMM.2017.2777441
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/144661