| 一类Alternant的格子复杂度上界 |
| |
| 引用本文： | 岳殿武.一类Alternant的格子复杂度上界[J].重庆邮电学院学报(自然科学版),1999,11(1):4-8. |
| |
| 作者姓名： | 岳殿武 |
| |
| 作者单位： | 南京邮电学院通信工程系 |
| |
| 摘 要： | 研究了Ａｌｔｅｒｎａｎｔ码的格子复杂度。利用码的直和结构。给出了一类Ａｌｔｅａｎｔ码的格子复杂度的上界，改进了Ｗｏｌｆ上界，推广了文献「３」的结果。
|
| 关 键 词： | 格子复杂度 Alternant码 软判决译码 |
A Upper Bound on the Trellis Complexity of a Class of Alternant Codes |
| |
| Yue Dianwu.A Upper Bound on the Trellis Complexity of a Class of Alternant Codes[J].Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition),1999,11(1):4-8. |
| |
| Authors: | Yue Dianwu |
| |
| Abstract: | In this paper, we study trellis complexity of Alternant codes. We first give an upper bound of trellis complexity of a kind of Alternant codes. This result improves the wolf upper bound and generalizes the result of reference . |
| |
| Keywords: | alternant code trellis complexity soft decision decoding |
| 本文献已被 CNKI 维普 等数据库收录！ |
