{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:27:25Z","timestamp":1762522045746,"version":"3.37.3"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100000266","name":"UK EPSRC","doi-asserted-by":"publisher","award":["EP\/K040006"],"award-info":[{"award-number":["EP\/K040006"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2017]]},"DOI":"10.1109\/access.2017.2736543","type":"journal-article","created":{"date-parts":[[2017,8,7]],"date-time":"2017-08-07T18:10:52Z","timestamp":1502129452000},"page":"19182-19193","source":"Crossref","is-referenced-by-count":6,"title":["Low Complexity Coefficient Selection Algorithms for Compute-and-Forward"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7086-8655","authenticated-orcid":false,"given":"Qinhui","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alister","family":"Burr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1201\/9781439864081","author":"stewart","year":"2001","journal-title":"Algebraic Number Theory and Fermat s Last Theorem"},{"journal-title":"A Course in Computational Algebraic Number Theory","year":"2013","author":"cohen","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2451623"},{"key":"ref13","article-title":"A multilevel framework for lattice network coding","author":"wang","year":"2015","journal-title":"CoRR"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.050813.120759"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2016.2611580"},{"key":"ref16","article-title":"Adaptive compute-andforward with lattice codes over algebraic integers","author":"huang","year":"2015","journal-title":"CoRR"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2012.070912.111948"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2537810"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2265695"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2274264"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028460"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1985-0777278-8"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/VTCSpring.2016.7504328"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541718"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2165816"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1145\/1161089.1161129","article-title":"Hot topic: Physical-layer network coding","author":"zhang","year":"2006","journal-title":"Proc 12th Annu Int Conf Mobile Comput Netw (MobiCom)"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"2701","DOI":"10.1109\/TSP.2009.2016267","article-title":"Complex lattice reduction algorithm for low-complexity full-diversity MIMO detection","volume":"57","author":"gan","year":"2009","journal-title":"IEEE Trans Signal Process"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2015.7227028"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICCW.2017.7962724"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2655515"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2012.6261897"},{"journal-title":"Polynomially solvable instances of the shortest and closest vector problems with applications to compute-and-forward","year":"2015","author":"sahraei","key":"ref23"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/7859429\/08003256.pdf?arnumber=8003256","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,26]],"date-time":"2024-06-26T01:24:46Z","timestamp":1719365086000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8003256\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/access.2017.2736543","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2017]]}}}