{"title":"高斯窃听格码从二进制自对偶码","authors":"Fuchun Lin, F. Oggier","doi":"10.1109/ITW.2012.6404761","DOIUrl":null,"url":null,"abstract":"We consider lattice coding over a Gaussian wiretap channel with respect to the secrecy gain, a lattice invariant introduced in [1] to characterize the confusion that a chosen lattice can cause at the eavesdropper. The secrecy gain of the best unimodular lattices constructed from binary self-dual codes in dimension n, 24 ≤ n ≤ 32 are calculated. Numerical upper bounds on the secrecy gain of unimodular lattices in general and of unimodular lattices constructed from binary self-dual codes in particular are derived for all even dimensions up to 168.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Gaussian wiretap lattice codes from binary self-dual codes\",\"authors\":\"Fuchun Lin, F. Oggier\",\"doi\":\"10.1109/ITW.2012.6404761\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider lattice coding over a Gaussian wiretap channel with respect to the secrecy gain, a lattice invariant introduced in [1] to characterize the confusion that a chosen lattice can cause at the eavesdropper. The secrecy gain of the best unimodular lattices constructed from binary self-dual codes in dimension n, 24 ≤ n ≤ 32 are calculated. Numerical upper bounds on the secrecy gain of unimodular lattices in general and of unimodular lattices constructed from binary self-dual codes in particular are derived for all even dimensions up to 168.\",\"PeriodicalId\":325771,\"journal\":{\"name\":\"2012 IEEE Information Theory Workshop\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Information Theory Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2012.6404761\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Information Theory Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2012.6404761","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Gaussian wiretap lattice codes from binary self-dual codes
We consider lattice coding over a Gaussian wiretap channel with respect to the secrecy gain, a lattice invariant introduced in [1] to characterize the confusion that a chosen lattice can cause at the eavesdropper. The secrecy gain of the best unimodular lattices constructed from binary self-dual codes in dimension n, 24 ≤ n ≤ 32 are calculated. Numerical upper bounds on the secrecy gain of unimodular lattices in general and of unimodular lattices constructed from binary self-dual codes in particular are derived for all even dimensions up to 168.