| 用最短路径集算法求模式的最简编码 |
| |
| 引用本文： | 曹鲁寅. 用最短路径集算法求模式的最简编码[J]. 安徽大学学报(自然科学版), 1991, 0(1) |
| |
| 作者姓名： | 曹鲁寅 |
| |
| 作者单位： | 安徽大学电子工程与信息科学系 |
| |
| 摘 要： | 本文将求模式的最简单编码问题转化成求加权有向图的最短路径集的问题来解决。因此,这个算法是有效的。
|
| 关 键 词： | 最小终端码 编码图 码权 最短路径 |
Obtain Simplest Pattern Codes with Shortest Paths Algorithm |
| |
| Cao Luyin. Obtain Simplest Pattern Codes with Shortest Paths Algorithm[J]. Journal of Anhui University(Natural Sciences), 1991, 0(1) |
| |
| Authors: | Cao Luyin |
| |
| Abstract: | In the coding theory of pattern perception,it is an important problem to obtain the simplest code. If we generaed all codes of the pattern and then selected the simplest one, this would take a lot of computing time. In this paper,we translate the search for a simplest code to a shortest path problem.In this way, the method is efficient. |
| |
| Keywords: | Minimal end code code graph weight of code shortest path |
| 本文献已被 CNKI 等数据库收录！ |
|
