| 关于几类线性分组码网格图复杂度的研究 |
| |
| 引用本文： | 慕建君,王新梅.关于几类线性分组码网格图复杂度的研究[J].通信学报,2001,22(11):6-10. |
| |
| 作者姓名： | 慕建君 王新梅 |
| |
| 作者单位： | 西安电子科技大学综合业务网国家重点实验室，陕西西安 710071 |
| |
| 基金项目： | 国家自然科学基金资助项目(69972035);华为科技基金项目 |
| |
| 摘 要： | 本文研究了几类线性分组码Cn，k，d]的网格图复杂度s（C）。给出并证明了码长为奇数的两类线性分组码的网格图复杂度。同时得出了有关可纠t个错的本原BCH码2^m-1,2^m-1-mt]及其扩展本在BCH码的网格图复杂度的若干结论。从而避免了必须先寻找码的直和结构才可得到码的网格图复杂度的较好上界。
|
| 关 键 词： | 线性分组码 网格图复杂度 最小网格图 软判决译码 |
| 文章编号： | 1000-436(2001)11-0006-05 |
Study on the trellis complexity of a few types of linear block codes |
| |
| MU Jian-jun,WANG Xin-mei.Study on the trellis complexity of a few types of linear block codes[J].Journal on Communications,2001,22(11):6-10. |
| |
| Authors: | MU Jian-jun WANG Xin-mei |
| |
| Abstract: | The trellis complexities s(C) of a few types of linear block codes Cn,k,d]are inveshgated. The trellis compelxities of two types of linear block codes whose code lewi is odd are shown. In the meantime some results are shown on the trellis complexity of t-error-cortechng primitive BCH codes 2m-1,2m-1-mt] and their extended pridrive BCH codes. Thus finding the dbect-sum structure of codes is avoided before we solve the suboptimal upper bound of their trellis complexity. |
| |
| Keywords: | linear block codes: trellis complexity minimal trellises soft-decision decoding |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
