{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T17:05:49Z","timestamp":1730221549671,"version":"3.28.0"},"reference-count":70,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1109\/ewdts50664.2020.9224643","type":"proceedings-article","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T20:00:47Z","timestamp":1602792047000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Hyper Neural Network as the Diffeomorphic Domain for Short Code Soft Decision Beyound Belief Propagation Decoding Problem"],"prefix":"10.1109","author":[{"given":"Usatyuk","family":"Vasiliy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Egorov","family":"Sergey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"2014","journal-title":"Github Repository","article-title":"SPECTRE: Short packet communication toolbox","key":"ref70"},{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1109\/ISIT.2017.8006751"},{"key":"ref38","first-page":"1770","article-title":"Learned D-AMP: principled neural network based compressive image recovery","author":"metzler","year":"2017","journal-title":"31st Intern Conf on Neural Inform Proc Systems"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1109\/TCOMM.2012.081512.110872"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1109\/TIT.2015.2410251"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1109\/ISIT.2018.8437581"},{"year":"0","article-title":"Usatyuk V.S. Improving of Polar decoding using LDPC cycle broking","key":"ref30"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1109\/TIT.2016.2556683"},{"key":"ref36","article-title":"Codes and Decoding on General Graphs","author":"wiberg","year":"1996","journal-title":"PhD thesis"},{"year":"2020","author":"rowshan","article-title":"Polarization-adjusted Convolutional (PAC) Codes: Fano Decoding vs List Decoding","key":"ref35"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1109\/JSAC.2015.2504269"},{"doi-asserted-by":"publisher","key":"ref60","DOI":"10.1007\/s00454-008-9053-2"},{"key":"ref62","article-title":"An introduction to optimization on smooth manifolds","author":"boumal","year":"2020","journal-title":"Lie bracket"},{"doi-asserted-by":"publisher","key":"ref61","DOI":"10.1007\/978-3-642-78393-7"},{"doi-asserted-by":"publisher","key":"ref63","DOI":"10.1109\/TIT.2015.2512596"},{"year":"2013","author":"fossorier","article-title":"Polar Codes: Graph Representation and Duality","key":"ref28"},{"key":"ref64","article-title":"A Tutorial on Distance Metric Learning: Mathematical Foundations","author":"su\u00e1rez","year":"2018","journal-title":"Algorithms and Software"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/TIT.2018.2866577"},{"key":"ref65","article-title":"Visualizing the Loss Landscape of Neural Nets","author":"li","year":"2018","journal-title":"NIPS"},{"doi-asserted-by":"publisher","key":"ref66","DOI":"10.1002\/0470035706"},{"year":"2013","author":"fossorier","article-title":"Congratulation to Marc briliant proof of scheduler interpretation of Polar code from LDPC point of view, sequential embedding to finite genus covering","key":"ref29"},{"key":"ref67","first-page":"1","article-title":"Construction of Length and Rate Adaptive MET QC-LDPC Codes by Cyclic Group Decomposition","author":"usatyuk","year":"2019","journal-title":"2019 IEEE East-West Design & Test Symposium (EWDTS)"},{"year":"0","author":"usatyuk","article-title":"Short-code performance under soft decision decoder","key":"ref68"},{"doi-asserted-by":"publisher","key":"ref69","DOI":"10.1109\/TIT.2010.2043769"},{"year":"2017","journal-title":"CCSDS 131 0-B-3 Standard","key":"ref2"},{"year":"0","article-title":"NR; Multiplexing and channel coding","key":"ref1"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/49.924874"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1109\/ISIT.1994.394624"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/TIT.2002.805089"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/TCOM.1981.1094916"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1109\/TIT.2004.826644"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1109\/18.910573"},{"key":"ref25","first-page":"84","article-title":"On the complexity of decoding","volume":"1","author":"pinsker","year":"1965","journal-title":"Problemy Peredachi Informatsii"},{"doi-asserted-by":"publisher","key":"ref50","DOI":"10.1109\/ICT.2016.7500492"},{"doi-asserted-by":"publisher","key":"ref51","DOI":"10.1038\/339693a0"},{"doi-asserted-by":"publisher","key":"ref59","DOI":"10.1137\/17M1148025"},{"year":"2019","author":"baldock","article-title":"Bayesian Neural Networks at Finite Temperature","key":"ref58"},{"key":"ref57","first-page":"569","article-title":"Information, Physics, and Computation Oxford Graduate Texts","author":"m\u00e9zard","year":"2009"},{"doi-asserted-by":"publisher","key":"ref56","DOI":"10.1209\/0295-5075\/25\/3\/001"},{"year":"0","author":"grassl","article-title":"Bounds on the minimum distance of linear codes and quantum codes","key":"ref55"},{"key":"ref54","first-page":"295","article-title":"Bounds on linear codes","author":"brouwer","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref53","first-page":"2603","article-title":"Interaction screening: efficient and sample-optimal learning of ising models","author":"marc vuffray","year":"2016","journal-title":"Proc 30th Int Conf Neural Inform Process Syst"},{"doi-asserted-by":"publisher","key":"ref52","DOI":"10.1002\/ett.1182"},{"key":"ref10","article-title":"Multi-edge type LDPC codes","author":"richardson","year":"2002","journal-title":"Workshop Honoring Prof Bob McEliece on his 60th Birthday"},{"key":"ref11","first-page":"1","article-title":"Analysis of Circular Buffer Rate Matching for LTE Turbo Code","author":"chenget","year":"2008","journal-title":"The IEEE 68th Vehicular Technology Conference"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1109\/ISIT.2005.1523374"},{"key":"ref12","first-page":"1426","article-title":"Error-floors of LDPC codes","author":"richardson","year":"2003","journal-title":"Proc 41st Annu Allerton Conf"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/MILCOM.2008.4753229"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/APCCAS.2008.4746396"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/TIT.2009.2015993"},{"key":"ref16","first-page":"1","article-title":"Efficient algorithms to find all small error-prone substructures in LDPC codes","author":"zhang","year":"2011","journal-title":"Global Telecommun Conf"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/ISTC.2014.6955087"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/TCOMM.2010.083110.080638"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.3850\/9783981537079_0760"},{"year":"2017","journal-title":"IEEE P802 3ca 50G-EPON","key":"ref4"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/TBC.2016.2515538"},{"year":"2019","article-title":"Usatyuk V.S. Generation of Spatially-Couple Quasi-cylic LDPC Codes, Public","key":"ref6"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/TSP.2019.8769083"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TSP.2009.2027773"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/TIT.2009.2025528"},{"doi-asserted-by":"publisher","key":"ref49","DOI":"10.1109\/GLOCOM.2005.1577834"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/TIT.2017.2746568"},{"key":"ref46","article-title":"Hyperbolic Graph Convolutional Neural Networks","author":"chami","year":"2019","journal-title":"NIPS"},{"key":"ref45","first-page":"1509","article-title":"HyperGCN: A New Method For Training Graph Convolutional Networks on Hypergraphs","volume":"32","author":"naganand","year":"2019","journal-title":"Advances in Neural IInformation Processing Systems"},{"doi-asserted-by":"publisher","key":"ref48","DOI":"10.1007\/978-1-4613-9586-7_3"},{"key":"ref47","first-page":"21","article-title":"Discrete groups of motions of Nonpositive Curvature Manifolds","author":"margulis","year":"1974","journal-title":"International Congress of Mathematicians"},{"key":"ref42","first-page":"2326","article-title":"Hyper-Graph-Network Decoders for Block Codes","volume":"32","author":"nachmani","year":"2019","journal-title":"Adv in Neural Info Proc Syst"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1109\/JSTSP.2017.2788405"},{"key":"ref44","article-title":"GNNExplainer: Generating Explanations for Graph Neural Networks","author":"ying","year":"2019","journal-title":"Neural Information Processing Systems (NeurIPS)"},{"doi-asserted-by":"publisher","key":"ref43","DOI":"10.1109\/IEEECONF44664.2019.9048728"}],"event":{"name":"2020 IEEE East-West Design & Test Symposium (EWDTS)","start":{"date-parts":[[2020,9,4]]},"location":"Varna, Bulgaria","end":{"date-parts":[[2020,9,7]]}},"container-title":["2020 IEEE East-West Design & Test Symposium (EWDTS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9220087\/9224633\/09224643.pdf?arnumber=9224643","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T15:48:28Z","timestamp":1656344908000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9224643\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9]]},"references-count":70,"URL":"https:\/\/doi.org\/10.1109\/ewdts50664.2020.9224643","relation":{},"subject":[],"published":{"date-parts":[[2020,9]]}}}