An Efficient Constrained Tree Search Algorithm for Determining the Free Distance of A Variable-Length Error-Correcting Prefix Code
碩士 === 國立交通大學 === 電信工程研究所 === 105 === In this paper, a new tree search algorithm for determining the free distance of variable-length error-correcting prefix code (VLECPC) is proposed. The idea is to structure all pairs of codeword-concatenation sequences as a tree, over which a pair of sequences th...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/7ucwdk |