@inproceedings{ODp10,
 abstract = {An approximate max-flow min-cut result for arbitrary wireless relay
network was recently established using Gaussian codebooks for
transmission and random mappings at the relays. In this paper,
we show that the approximation result can be established
by using lattices for transmission and quantization along with
structured mappings at the relays. This also extended the original scalar quantizer
analysis to vector quantizers and obtained a slightly better approximation constant.},
 author = {A. Ozgur and S N. Diggavi},
 booktitle = {Proc. of IEEE ISIT 2010, Austin, Texas},
 file = {:papers:od_isit10.pdf},
 month = {June},
 note = {},
 pages = {669--673},
 tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,SelConf,LatticeChan},
 title = {Approximately achieving Gaussian relay network capacity with lattice codes},
 type = {4},
 url_arxiv = {http://arxiv.org/abs/1005.1284},
 year = {2010}
}

{"_id":"PZddmsFEw4FZkyJXc","bibbaseid":"ozgur-diggavi-approximatelyachievinggaussianrelaynetworkcapacitywithlatticecodes-2010","author_short":["Ozgur, A.","Diggavi, S N."],"bibdata":{"bibtype":"inproceedings","type":"4","abstract":"An approximate max-flow min-cut result for arbitrary wireless relay network was recently established using Gaussian codebooks for transmission and random mappings at the relays. In this paper, we show that the approximation result can be established by using lattices for transmission and quantization along with structured mappings at the relays. This also extended the original scalar quantizer analysis to vector quantizers and obtained a slightly better approximation constant.","author":[{"firstnames":["A."],"propositions":[],"lastnames":["Ozgur"],"suffixes":[]},{"firstnames":["S","N."],"propositions":[],"lastnames":["Diggavi"],"suffixes":[]}],"booktitle":"Proc. of IEEE ISIT 2010, Austin, Texas","file":":papers:od_isit10.pdf","month":"June","note":"","pages":"669–673","tags":"conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,SelConf,LatticeChan","title":"Approximately achieving Gaussian relay network capacity with lattice codes","url_arxiv":"http://arxiv.org/abs/1005.1284","year":"2010","bibtex":"@inproceedings{ODp10,\n abstract = {An approximate max-flow min-cut result for arbitrary wireless relay\nnetwork was recently established using Gaussian codebooks for\ntransmission and random mappings at the relays. In this paper,\nwe show that the approximation result can be established\nby using lattices for transmission and quantization along with\nstructured mappings at the relays. This also extended the original scalar quantizer\nanalysis to vector quantizers and obtained a slightly better approximation constant.},\n author = {A. Ozgur and S N. Diggavi},\n booktitle = {Proc. of IEEE ISIT 2010, Austin, Texas},\n file = {:papers:od_isit10.pdf},\n month = {June},\n note = {},\n pages = {669--673},\n tags = {conf,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow,SelConf,LatticeChan},\n title = {Approximately achieving Gaussian relay network capacity with lattice codes},\n type = {4},\n url_arxiv = {http://arxiv.org/abs/1005.1284},\n year = {2010}\n}\n\n","author_short":["Ozgur, A.","Diggavi, S N."],"key":"ODp10","id":"ODp10","bibbaseid":"ozgur-diggavi-approximatelyachievinggaussianrelaynetworkcapacitywithlatticecodes-2010","role":"author","urls":{" arxiv":"http://arxiv.org/abs/1005.1284"},"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"https://bibbase.org/network/files/e2kjGxYgtBo8SWSbC","dataSources":["hicKnsKYNEFXC4CgH","jxCYzXXYRqw2fiEXQ","wCByFFrQMyRwfzrJ6","yuqM5ah4HMsTyDrMa","YaM87hGQiepg5qijZ","n9wmfkt5w8CPqCepg","soj2cS6PgG8NPmWGr","FaDBDiyFAJY5pL28h","ycfdiwWPzC2rE6H77"],"keywords":[],"search_terms":["approximately","achieving","gaussian","relay","network","capacity","lattice","codes","ozgur","diggavi"],"title":"Approximately achieving Gaussian relay network capacity with lattice codes","year":2010}