.png){kind=icon}
返回
Convolutional Codes Under a Minimal Trellis Complexity Measure
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2009.0901.060437.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We conduct a code search, restricted to the recently introduced class of generalized punctured convolutional codes, under the minimal trellis complexity measure defined by McEliece and Lin. For the same decoding complexity and the same code rate, new codes are compared to well-known existing classes of convolutional codes. Some of the best convolutional codes (in a distance spectrum sense) of existing and new trellis complexities are tabulated.
Keyword:
Convolutional codes
decoding complexity
distance spectrum
minimal trellis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
查看更多机构
引用论文
分享收藏Facies, development and interpretation of sedimentary environment of the uranium-bearing Brebovnica Member of the Val Gardena Formation in the Žirovski vrh area, W Slovenia.png)
Geologija
OAAI
GeologijaIF0
OAAI分享收藏
Transition metal–carbene complexes XCVII. π-cyclopentadienyldicarbonylmethylphenylcarbenerhenium
PREAI
分享收藏 没有更多内容