{"title":"隐写信道的纠错码","authors":"A. D'yachkov, D. Harnett, V. Rykov","doi":"10.1109/SIBIRCON.2008.4602619","DOIUrl":null,"url":null,"abstract":"A steganography channel is a method of transmitting hidden data by embedding it into another document in a way that is difficult to detect. In this paper, we analyze a model of data-hiding for communication via noiseless steganography channel by application of error-correcting codes. Two corresponding Shannon theorems are proved, and the average covering radius of a code is discussed as an important parameter for steganography applications. The Shannon theorems generalize the results obtained in D'yachkov (2006) for the binary model.","PeriodicalId":295946,"journal":{"name":"2008 IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On error-correcting codes for a steganography channel\",\"authors\":\"A. D'yachkov, D. Harnett, V. Rykov\",\"doi\":\"10.1109/SIBIRCON.2008.4602619\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A steganography channel is a method of transmitting hidden data by embedding it into another document in a way that is difficult to detect. In this paper, we analyze a model of data-hiding for communication via noiseless steganography channel by application of error-correcting codes. Two corresponding Shannon theorems are proved, and the average covering radius of a code is discussed as an important parameter for steganography applications. The Shannon theorems generalize the results obtained in D'yachkov (2006) for the binary model.\",\"PeriodicalId\":295946,\"journal\":{\"name\":\"2008 IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-07-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIBIRCON.2008.4602619\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIBIRCON.2008.4602619","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On error-correcting codes for a steganography channel
A steganography channel is a method of transmitting hidden data by embedding it into another document in a way that is difficult to detect. In this paper, we analyze a model of data-hiding for communication via noiseless steganography channel by application of error-correcting codes. Two corresponding Shannon theorems are proved, and the average covering radius of a code is discussed as an important parameter for steganography applications. The Shannon theorems generalize the results obtained in D'yachkov (2006) for the binary model.