English

应用科学学报 ›› 2000, Vol. 18 ›› Issue (1): 68-71.

• 论文 • 上一篇    下一篇

线性等重码格子复杂度的确定

岳殿武, 江凌云, 段冰娟   

  1. 南京邮电学院通信工程系, 江苏南京 210003
  • 收稿日期:1998-11-22 修回日期:1999-04-09 出版日期:2000-03-31 发布日期:2000-03-31
  • 作者简介:岳殿武(1965-),男,吉林四平人,副教授,博士.
  • 基金资助:
    国家自然科学基金(19671087)和江苏省教委"青蓝工程"基金资助项目

The Determination of Trellis Complexity of Linear Constant Weight Codes

YUE Dian-wu, JIANG Ling-yun, DUAN Bing-juan   

  1. Nanjing University of Posts and Telecommunications, Nanjing 210003 China
  • Received:1998-11-22 Revised:1999-04-09 Online:2000-03-31 Published:2000-03-31

PDF

162

被引次数

3

摘要： 研究了线性等重码的格子复杂度.利用维数/长度轮廓和广义Hamming重量知识,确定了线性等重码格子复杂度,改进了Y.Berger和Y.Be'ery(1993)的结果.

关键词: 格子复杂度, 广义Hamming重量, 维数/长度轮廓, 线性等重码

Abstract: 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.

Key words: genera lized Hamming weight, trellis complexity, linear constant weight code, dimension/length profile

中图分类号: