Or Ordentlich, Jiening Zhan, U. Erez, M. Gastpar, B. Nazer
{"title":"实用代码设计的计算机和转发","authors":"Or Ordentlich, Jiening Zhan, U. Erez, M. Gastpar, B. Nazer","doi":"10.1109/ISIT.2011.6033876","DOIUrl":null,"url":null,"abstract":"The Compute-and-Forward approach has been proven to be very beneficial for communication over Gaussian networks. While the theoretical results are promising, it is still not completely understood how to best apply this scheme in practice. The objective of this work is to provide a low complexity scheme suitable for Compute-and-Forward. The scheme is based on utilizing linear codes over ℤq where q is not restricted to be prime and allows to achieve high transmission rates following Ungerboeck's set partitioning principle.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"37","resultStr":"{\"title\":\"Practical code design for compute-and-forward\",\"authors\":\"Or Ordentlich, Jiening Zhan, U. Erez, M. Gastpar, B. Nazer\",\"doi\":\"10.1109/ISIT.2011.6033876\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Compute-and-Forward approach has been proven to be very beneficial for communication over Gaussian networks. While the theoretical results are promising, it is still not completely understood how to best apply this scheme in practice. The objective of this work is to provide a low complexity scheme suitable for Compute-and-Forward. The scheme is based on utilizing linear codes over ℤq where q is not restricted to be prime and allows to achieve high transmission rates following Ungerboeck's set partitioning principle.\",\"PeriodicalId\":208375,\"journal\":{\"name\":\"2011 IEEE International Symposium on Information Theory Proceedings\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"37\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Symposium on Information Theory Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2011.6033876\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Symposium on Information Theory Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2011.6033876","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Compute-and-Forward approach has been proven to be very beneficial for communication over Gaussian networks. While the theoretical results are promising, it is still not completely understood how to best apply this scheme in practice. The objective of this work is to provide a low complexity scheme suitable for Compute-and-Forward. The scheme is based on utilizing linear codes over ℤq where q is not restricted to be prime and allows to achieve high transmission rates following Ungerboeck's set partitioning principle.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
