通过碰撞计数检测和重构未知卷积码

Marion Bellard, J. Tillich
{"title":"通过碰撞计数检测和重构未知卷积码","authors":"Marion Bellard, J. Tillich","doi":"10.1109/ISIT.2014.6875378","DOIUrl":null,"url":null,"abstract":"We suggest in this paper a new method for detecting whether a given binary sequence is a noisy convolutional codeword obtained from an unknown convolutional code. It basically consists in forming blocks of the sequence which are big enough to contain the support of a codeword in the dual of the convolutional code and to count the number of blocks which are equal. This detection process is quite efficient and presents the advantage over all previously known methods to achieve this goal even in the case of an unknown modulation. Moreover, this method can also be used to reconstruct the unknown convolutional code when the modulation is known.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Detecting and reconstructing an unknown convolutional code by counting collisions\",\"authors\":\"Marion Bellard, J. Tillich\",\"doi\":\"10.1109/ISIT.2014.6875378\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We suggest in this paper a new method for detecting whether a given binary sequence is a noisy convolutional codeword obtained from an unknown convolutional code. It basically consists in forming blocks of the sequence which are big enough to contain the support of a codeword in the dual of the convolutional code and to count the number of blocks which are equal. This detection process is quite efficient and presents the advantage over all previously known methods to achieve this goal even in the case of an unknown modulation. Moreover, this method can also be used to reconstruct the unknown convolutional code when the modulation is known.\",\"PeriodicalId\":127191,\"journal\":{\"name\":\"2014 IEEE International Symposium on Information Theory\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-08-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2014.6875378\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2014.6875378","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

本文提出了一种检测给定二进制序列是否是由未知卷积码得到的噪声卷积码字的新方法。它基本上包括形成足够大的序列块,以包含卷积码对偶中的码字支持,并计算相等块的数量。这种检测过程是相当有效的,并且即使在未知调制的情况下,也比所有以前已知的方法都具有优势。此外,该方法还可用于在调制已知的情况下对未知卷积码进行重构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Detecting and reconstructing an unknown convolutional code by counting collisions
We suggest in this paper a new method for detecting whether a given binary sequence is a noisy convolutional codeword obtained from an unknown convolutional code. It basically consists in forming blocks of the sequence which are big enough to contain the support of a codeword in the dual of the convolutional code and to count the number of blocks which are equal. This detection process is quite efficient and presents the advantage over all previously known methods to achieve this goal even in the case of an unknown modulation. Moreover, this method can also be used to reconstruct the unknown convolutional code when the modulation is known.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信