Reconstruction of Punctured Convolutional Codes

被引：0

作者：

Cluzeau, Mathieu ^{[1
]}

Finiasz, Matthieu ^{[1
]}

机构：

[1] ENSTA, Paris, France

来源：

2009 IEEE INFORMATION THEORY WORKSHOP (ITW 2009) | 2009年

关键词：

convolutional codes; puncturing; reconstruction;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We present here a new technique to reconstruct punctured convolutional codes from a noisy intercepted bitstream. Compared to existing techniques our algorithm has two major advantages: it can tolerate much higher noise levels in the bitstream and it is able to recover the best possible decoder (in terms of decoding complexity). This is achieved by identifying the exact puncturing pattern that was used and recovering the parent convolutional code.

引用

页码：75 / 79

页数：5

共 13 条

[1] BARBIER J, 2007, THESIS ECOLE POLYTEC
[2] Barbier J., 2006, CCIS 2006
[3] Berlekamp E. R., 2015, ALGEBRAIC CODING THE
[4] A new algorithm for finding minimum-weight words in a linear code: Application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
Canteaut, A
Chabaud, F
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (01) : 367 - 378
[5] Cote M., 2009, IEEE C ISIT IN PRESS
[6] Parameter estimation of a convolutional encoder from noisy observations
Dingel, Janis
Hagenauer, Joachim
[J]. 2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 1776 - 1780
[7] Filiol E, 1997, LECT NOTES COMPUT SC, V1355, P101, DOI 10.1007/BFb0024454
[8] FILIOL E, 2001, THESIS ECOLE POLYTEC
[9] FILIOL E, 2000, INT S INF THEOR ITS
[10] Johannesson R., 1999, FUNDAMENTALS CONVOLU

← 1 2 →