摘要
研究了线性分组码的格子复杂度，利用维数／长度轮廓和广义汉明权知识，给出了线性分组码格子复杂度的一个简单而实用下界。Ｄ．Ｊ．Ｍｕｄｅｒ曾给出过一个简单而实用的下界，这里所给出的下界与ＤＪＭｕｄｅｒ所给出的下界互补。
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.
出处
《南京邮电学院学报》
1998年第4期1-4,共4页
Journal of Nanjing University of Posts and Telecommunications(Natural Science)
基金
国家自然科学基金
关键词
线性分组码
格子复杂度
维数/长度轮廓
Linear block code,Trellis complexity,Dimension/length profiles,Generalized Hamming weight
