{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T07:15:57Z","timestamp":1766733357594,"version":"3.37.3"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Select. Areas Commun."],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1109\/jsac.2020.3036951","type":"journal-article","created":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T20:58:28Z","timestamp":1604955508000},"page":"79-88","source":"Crossref","is-referenced-by-count":8,"title":["perm2vec: Attentive Graph Permutation Selection for Decoding of Error Correction Codes"],"prefix":"10.1109","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0573-1075","authenticated-orcid":false,"given":"Avi","family":"Caciularu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0918-6721","authenticated-orcid":false,"given":"Nir","family":"Raviv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomer","family":"Raviv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacob","family":"Goldberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9642-8391","authenticated-orcid":false,"given":"Yair","family":"Be'ery","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3383313.3412226"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053071"},{"key":"ref33","first-page":"5753","article-title":"XLNet: Generalized autoregressive pretraining for language understanding","author":"yang","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref32","article-title":"RoBERTa: A robustly optimized BERT pretraining approach","author":"liu","year":"2019","journal-title":"arXiv 1907 11692"},{"key":"ref31","first-page":"1","article-title":"BERT: Pre-training of deep bidirectional transformers for language understanding","author":"devlin","year":"2019","journal-title":"Proc Conf North Amer Chapter Assoc Comput Linguistics (NAACL)"},{"key":"ref30","first-page":"1","article-title":"Neural machine translation by jointly learning to align and translate","author":"bahdanau","year":"2015","journal-title":"Proc Int Conf Learn Represent (ICLR)"},{"key":"ref37","first-page":"337","article-title":"Image-and-spatial transformer networks for structure-guided image registration","author":"lee","year":"2019","journal-title":"Proc Int Conf Med Image Comput Comput Assist Intervent (MICCAI)"},{"key":"ref36","article-title":"End-to-end object detection with transformers","author":"carion","year":"2020","journal-title":"arXiv 2005 12872"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W18-5446"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1588"},{"key":"ref10","article-title":"Data-efficient mutual information neural estimator","author":"lin","year":"2019","journal-title":"arXiv 1905 03319"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5722"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2955724"},{"key":"ref12","article-title":"From learning to meta-learning: Reduced training overhead and complexity for communication systems","author":"simeone","year":"2020","journal-title":"arXiv 2001 01227"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2017.7926071"},{"key":"ref14","first-page":"1","article-title":"Communication algorithms via deep learning","author":"kim","year":"2018","journal-title":"Proc Int Conf Learn Represent (ICLR)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852251"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2017.2788405"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647308"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849419"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919799"},{"key":"ref28","volume":"16","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.07.070621"},{"key":"ref27","article-title":"The permutation groups and the equivalence of cyclic and quasi-cyclic codes","author":"guenda","year":"2010","journal-title":"arXiv 1002 2456"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1964.tb04075.x"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2018.2881442"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2850772"},{"key":"ref8","first-page":"531","article-title":"Mutual information neural estimation","author":"belghazi","year":"2018","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2924010"},{"journal-title":"Probabilistic Reasoning in Intelligent Systems Networks of Plausible Inference","year":"2014","author":"pearl","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICCW.2018.8403666"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref20","first-page":"5998","article-title":"Attention is all you need","author":"vaswani","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2018.8625281"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849320"},{"key":"ref42","article-title":"Near maximum likelihood decoding with deep learning","author":"nachmani","year":"2018","journal-title":"arXiv 1801 02726"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437530"},{"key":"ref41","article-title":"RNN decoding of linear block codes","author":"nachmani","year":"2017","journal-title":"arXiv 1702 07560"},{"article-title":"Polar codes for channel and source coding","year":"2009","author":"korada","key":"ref23"},{"journal-title":"Database of Channel Codes and ML Simulation Results","year":"2019","author":"helmling","key":"ref44"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2805906"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1186\/1687-1499-2012-314"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"}],"container-title":["IEEE Journal on Selected Areas in Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/49\/9295467\/09252949.pdf?arnumber=9252949","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T22:31:05Z","timestamp":1643149865000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9252949\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":44,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/jsac.2020.3036951","relation":{},"ISSN":["0733-8716","1558-0008"],"issn-type":[{"type":"print","value":"0733-8716"},{"type":"electronic","value":"1558-0008"}],"subject":[],"published":{"date-parts":[[2021,1]]}}}