{"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}
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.