| 线性分组码格子复杂度的一个简单下界 |
| |
| 引用本文： | 岳殿武. 线性分组码格子复杂度的一个简单下界[J]. 南京邮电大学学报(自然科学版), 1998, 0(4) |
| |
| 作者姓名： | 岳殿武 |
| |
| 作者单位： | 南京邮电学院通信工程系 |
| |
| 摘 要： | 研究了线性分组码的格子复杂度，利用维数／长度轮廓和广义汉明权知识，给出了线性分组码格子复杂度的一个简单而实用下界。Ｄ．Ｊ．Ｍｕｄｅｒ曾给出过一个简单而实用的下界，这里所给出的下界与ＤＪＭｕｄｅｒ所给出的下界互补。
|
| 关 键 词： | 线性分组码，格子复杂度，维数／长度轮廓，广义汉明权 |
A Simple Lower Bound of Trellis Complexity of Linear Block Codes |
| |
| Yue Dianwu. A Simple Lower Bound of Trellis Complexity of Linear Block Codes[J]. JJournal of Nanjing University of Posts and Telecommunications, 1998, 0(4) |
| |
| Authors: | Yue Dianwu |
| |
| Affiliation: | Yue Dianwu Department of Communication Engineering,Nanjing Institute of Posts and Telecommunications,210003,Nanjing,PRC |
| |
| Abstract: | In this paper,we study trellis complexity of linear codes and derive a simple lower bound of trellis complexity of linear codes from knowledge of dimension/length profiles and generalized Hamming weighs.D.J.Muder has given another simple lower bound of trellis complexity of linear codes, the two bounds complement each other. |
| |
| Keywords: | Linear block code Trellis complexity Dimension/length profiles Generalized Hamming weight |
| 本文献已被 CNKI 等数据库收录！ |
