{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T16:27:18Z","timestamp":1781368038346,"version":"3.54.1"},"reference-count":70,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100008982","name":"NSF","doi-asserted-by":"publisher","award":["CNS-2002932"],"award-info":[{"award-number":["CNS-2002932"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"NSF","doi-asserted-by":"publisher","award":["CNS-2002664"],"award-info":[{"award-number":["CNS-2002664"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"Intel","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1109\/jsait.2020.2991562","type":"journal-article","created":{"date-parts":[[2020,5,5]],"date-time":"2020-05-05T00:08:30Z","timestamp":1588637310000},"page":"5-18","source":"Crossref","is-referenced-by-count":48,"title":["Physical Layer Communication via Deep Learning"],"prefix":"10.1109","volume":"1","author":[{"given":"Hyeji","family":"Kim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8975-8306","authenticated-orcid":false,"given":"Sewoong","family":"Oh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pramod","family":"Viswanath","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2017.8254811"},{"key":"ref39","author":"du","year":"2018","journal-title":"On the power of over-parametrization in neural networks with quadratic activation"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1049\/el:19970362"},{"key":"ref33","first-page":"2672","article-title":"Generative adversarial nets","author":"goodfellow","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref32","first-page":"2754","article-title":"Turbo autoencoder: Deep learning based channel codes for point-to-point communication channels","author":"jiang","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437530"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919799"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595172"},{"key":"ref36","author":"brock","year":"2018","journal-title":"Large scale gan training for high fidelity natural image synthesis"},{"key":"ref35","first-page":"6626","article-title":"GANs trained by a two time-scale update rule converge to a local Nash equilibrium","author":"heusel","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref34","first-page":"1498","article-title":"PacGAN: The power of two samples in generative adversarial networks","author":"lin","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2018.8445920"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2018.2865109"},{"key":"ref61","author":"balevi","year":"2019","journal-title":"Autoencoder-based error correction coding for one-bit quantization"},{"key":"ref63","author":"choi","year":"2018","journal-title":"NECST Neural joint source-channel coding"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2018.8645372"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8461983"},{"key":"ref27","author":"nachmani","year":"2018","journal-title":"Near maximum likelihood decoding with deep learning"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8683463"},{"key":"ref66","author":"makkuva","year":"2019","journal-title":"Learning in gated neural networks"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2019.8761399"},{"key":"ref67","first-page":"4304","article-title":"Breaking the gridlock in mixture-of-experts: Consistent and efficient algorithms","volume":"97","author":"makkuva","year":"2019","journal-title":"Proceedings 36th Int Conf Mach Learn"},{"key":"ref68","author":"cammerer","year":"2019","journal-title":"Trainable communication systems Concepts and prototype"},{"key":"ref69","first-page":"51","article-title":"End-to-end learning for physical layer communications","author":"cammerer","year":"2018","journal-title":"Proc IEEE Int Zürich Seminar Inf Commun (IZS)"},{"key":"ref2","first-page":"3111","article-title":"Distributed representations of words and phrases and their compositionality","author":"mikolov","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-015-0816-y"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/IEEECONF44664.2019.9048728"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2017.7926071"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.2972352"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2017.2788405"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852251"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849419"},{"key":"ref25","author":"raviv","year":"2020","journal-title":"Data-driven ensembles for deep and hard-decision hybrid decoding"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503226"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2868322"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2494061"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref57","year":"2016","journal-title":"Performance Evaluation of Channel Codes for Control Channel"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034896"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1966.1053879"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056798"},{"key":"ref53","first-page":"9436","article-title":"DeepCode: Feedback codes via deep learning","author":"kim","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref52","author":"farsad","year":"2020","journal-title":"Data-driven symbol detection via model-based machine learning"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/26.486609"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.dsp.2005.12.002"},{"key":"ref40","author":"liang","year":"2019","journal-title":"Revisiting landscape analysis in deep neural networks Eliminating decreasing paths to infinity"},{"key":"ref12","author":"chen","year":"2017","journal-title":"Supervised Community Detection with Line Graph Neural Networks"},{"key":"ref13","first-page":"6348","article-title":"Learning combinatorial optimization algorithms over graphs","author":"khalil","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref14","author":"nowak","year":"2017","journal-title":"Revised note on learning algorithms for quadratic assignment with graph neural networks"},{"key":"ref15","author":"venkatakrishnan","year":"2018","journal-title":"Graph2Seq Scalable learning dynamics for graphs"},{"key":"ref16","first-page":"1","article-title":"Communication algorithms via deep learning","author":"kim","year":"2018","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2018.8645128"},{"key":"ref18","author":"be\u2019ery","year":"2019","journal-title":"Active deep decoding of linear codes"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2019.8815400"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1054010"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/nature16961"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055186"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1179"},{"key":"ref7","author":"goodfellow","year":"2016","journal-title":"Deep Learning"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2908870"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICT.2017.7998249"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1186\/s13638-018-1238-7"},{"key":"ref48","author":"huang","year":"2019","journal-title":"AI Coding Learning to Construct Error Correction Codes"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919804"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2017.2758370"},{"key":"ref41","author":"neyshabur","year":"2018","journal-title":"Towards understanding the role of over-parametrization in generalization of neural networks"},{"key":"ref44","author":"jiang","year":"2018","journal-title":"LEARN Codes Inventing low-latency codes via recurrent neural networks"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2018.8645416"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/8768428\/9085350-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/8768428\/09085350.pdf?arnumber=9085350","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T13:16:35Z","timestamp":1651065395000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9085350\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":70,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/jsait.2020.2991562","relation":{},"ISSN":["2641-8770"],"issn-type":[{"value":"2641-8770","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5]]}}}