{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T11:09:06Z","timestamp":1772795346193,"version":"3.50.1"},"reference-count":17,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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 Commun. Lett."],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1109\/lcomm.2017.2757465","type":"journal-article","created":{"date-parts":[[2017,10,2]],"date-time":"2017-10-02T18:43:45Z","timestamp":1506969825000},"page":"17-20","source":"Crossref","is-referenced-by-count":16,"title":["(Perfect) Integer Codes Correcting Single Errors"],"prefix":"10.1109","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3715-468X","authenticated-orcid":false,"given":"Aleksandar","family":"Radonjic","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2011.243"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2016.0097"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2598803"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2644661"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1982.1095369"},{"key":"ref15","first-page":"7","article-title":"Low power consuming FEC scheme","author":"bajic","year":"2005","journal-title":"Proc 4th Int Workshop on Optimal Codes and Related Topics"},{"key":"ref16","author":"mehlhorn","year":"2008","journal-title":"Algorithms and Data Structures The Basic Toolbox"},{"key":"ref17","author":"comer","year":"2013","journal-title":"Internetworking With TCP\/IP"},{"key":"ref4","first-page":"288","article-title":"Correction code for single asymmetric errors","volume":"26","author":"varshamov","year":"1965","journal-title":"Automat Telemekh"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.10.023"},{"key":"ref6","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"levenshtein","year":"1966","journal-title":"Sov Phys -Dokl"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(79)90329-2"},{"key":"ref8","first-page":"2013","article-title":"Codes over the ring of integers modulo m","volume":"e81 a","author":"vinck","year":"1998","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.556130"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"223","DOI":"10.3934\/amc.2008.2.223","article-title":"A survey of perfect codes","volume":"2","author":"heden","year":"2008","journal-title":"Adv Math Commun"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13797-6_17"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/8249516\/08055561.pdf?arnumber=8055561","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T23:36:38Z","timestamp":1643153798000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8055561\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":17,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2017.2757465","relation":{},"ISSN":["1089-7798"],"issn-type":[{"value":"1089-7798","type":"print"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}