Show simple item record

dc.contributor.authorBailey, Robert F.
dc.contributor.authorGonzález Yero, Ismael 
dc.contributor.otherMatemáticasen_US
dc.date.accessioned2019-11-06T11:13:09Z
dc.date.available2019-11-06T11:13:09Z
dc.date.issued2019
dc.identifier.issn1234-3099
dc.identifier.issn2083-5892
dc.identifier.urihttp://hdl.handle.net/10498/21882
dc.description.abstractWe demonstrate a construction of error-correcting codes from graphs by means of k-resolving sets, and present a decoding algorithm which makes use of covering designs. Along the way, we determine the k-metric dimension of grid graphs (i.e., Cartesian products of paths).en_US
dc.formatapplication/pdfen_US
dc.language.isoengen_US
dc.publisherUNIV ZIELONA GORAen_US
dc.sourceDiscussiones Mathematicae Graph Theory 39 (2019) 341–355en_US
dc.subjecterror-correcting code, k-resolving seten_US
dc.subjectk-metric dimensionen_US
dc.subjectcovering designen_US
dc.subjectuncovering, grid graphen_US
dc.titleError-Correcting codes fromk-resolving setsen_US
dc.typejournal articleen_US
dc.rights.accessRightsopen accessen_US
dc.identifier.doi10.7151/dmgt.2087


Files in this item

This item appears in the following Collection(s)

Show simple item record