摘要
研究了线性等重码的格子复杂度 .利用维数 /长度轮廓和广义 Hamming重量知识 ,确定了线性等重码格子复杂度 ,改进了 Y. Berger和 Y. Be′ery(1993)
In this paper, the trellis complexity of linear constant weight codes is considered. The trellis complexity of linear constant weight codes is determined with the help of the knowledge of dimension/length profiles and generalized Hamming weights, which improves the related result given by Y. Berger and Y. Be′ery in 1993.
出处
《应用科学学报》
CAS
CSCD
2000年第1期68-71,共4页
Journal of Applied Sciences
基金
国家自然科学基金!( 196710 87)
江苏省教委"青蓝工程"基金资助项目
关键词
线性等重码
格子复杂度
数字通信
编码
linear constant weight code
trellis complexity
dimension/length profile
genera lized Hamming weight
