Error-Correcting Codes from k-Resolving Sets

We 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).

Gespeichert in:

Autor*in:	Bailey Robert F. [verfasserIn] Yero Ismael G. [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2019

Schlagwörter:	error-correcting code k-resolving set k-metric dimension covering design uncovering grid graph 05c12 94b25 05b40 94b35

Übergeordnetes Werk:	In: Discussiones Mathematicae Graph Theory - Sciendo, 2014, 39(2019), 2, Seite 341-355
Übergeordnetes Werk:	volume:39 ; year:2019 ; number:2 ; pages:341-355

Links:	Link aufrufen Link aufrufen Link aufrufen Journal toc

DOI / URN:	10.7151/dmgt.2087

Katalog-ID:	DOAJ021229368

Internformat


LEADER	01000caa a22002652 4500
001	DOAJ021229368
003	DE-627
005	20230307044628.0
007	cr uuu---uuuuu
008	230226s2019 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.7151/dmgt.2087 \|2 doi
035			\|a (DE-627)DOAJ021229368
035			\|a (DE-599)DOAJ080b23c3455343fba27d23acf1254744
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
050		0	\|a QA1-939
100	0		\|a Bailey Robert F. \|e verfasserin \|4 aut
245	1	0	\|a Error-Correcting Codes from k-Resolving Sets
264		1	\|c 2019
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a We 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).
650		4	\|a error-correcting code
650		4	\|a k-resolving set
650		4	\|a k-metric dimension
650		4	\|a covering design
650		4	\|a uncovering
650		4	\|a grid graph
650		4	\|a 05c12
650		4	\|a 94b25
650		4	\|a 05b40
650		4	\|a 94b35
653		0	\|a Mathematics
700	0		\|a Yero Ismael G. \|e verfasserin \|4 aut
773	0	8	\|i In \|t Discussiones Mathematicae Graph Theory \|d Sciendo, 2014 \|g 39(2019), 2, Seite 341-355 \|w (DE-627)633752266 \|w (DE-600)2568813-3 \|x 20835892 \|7 nnns
773	1	8	\|g volume:39 \|g year:2019 \|g number:2 \|g pages:341-355
856	4	0	\|u https://doi.org/10.7151/dmgt.2087 \|z kostenfrei
856	4	0	\|u https://doaj.org/article/080b23c3455343fba27d23acf1254744 \|z kostenfrei
856	4	0	\|u https://doi.org/10.7151/dmgt.2087 \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/2083-5892 \|y Journal toc \|z kostenfrei
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_DOAJ
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_39
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_95
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_151
912			\|a GBV_ILN_161
912			\|a GBV_ILN_170
912			\|a GBV_ILN_206
912			\|a GBV_ILN_213
912			\|a GBV_ILN_230
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_2005
912			\|a GBV_ILN_2009
912			\|a GBV_ILN_2011
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_2055
912			\|a GBV_ILN_2111
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4326
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 39 \|j 2019 \|e 2 \|h 341-355

Indexfelder

author_variant	b r f brf y i g yig
matchkey_str	article:20835892:2019----::rocretncdsrmr
hierarchy_sort_str	2019
callnumber-subject-code	QA
publishDate	2019
allfields	10.7151/dmgt.2087 doi (DE-627)DOAJ021229368 (DE-599)DOAJ080b23c3455343fba27d23acf1254744 DE-627 ger DE-627 rakwb eng QA1-939 Bailey Robert F. verfasserin aut Error-Correcting Codes from k-Resolving Sets 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier We 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). error-correcting code k-resolving set k-metric dimension covering design uncovering grid graph 05c12 94b25 05b40 94b35 Mathematics Yero Ismael G. verfasserin aut In Discussiones Mathematicae Graph Theory Sciendo, 2014 39(2019), 2, Seite 341-355 (DE-627)633752266 (DE-600)2568813-3 20835892 nnns volume:39 year:2019 number:2 pages:341-355 https://doi.org/10.7151/dmgt.2087 kostenfrei https://doaj.org/article/080b23c3455343fba27d23acf1254744 kostenfrei https://doi.org/10.7151/dmgt.2087 kostenfrei https://doaj.org/toc/2083-5892 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2111 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 39 2019 2 341-355
spelling	10.7151/dmgt.2087 doi (DE-627)DOAJ021229368 (DE-599)DOAJ080b23c3455343fba27d23acf1254744 DE-627 ger DE-627 rakwb eng QA1-939 Bailey Robert F. verfasserin aut Error-Correcting Codes from k-Resolving Sets 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier We 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). error-correcting code k-resolving set k-metric dimension covering design uncovering grid graph 05c12 94b25 05b40 94b35 Mathematics Yero Ismael G. verfasserin aut In Discussiones Mathematicae Graph Theory Sciendo, 2014 39(2019), 2, Seite 341-355 (DE-627)633752266 (DE-600)2568813-3 20835892 nnns volume:39 year:2019 number:2 pages:341-355 https://doi.org/10.7151/dmgt.2087 kostenfrei https://doaj.org/article/080b23c3455343fba27d23acf1254744 kostenfrei https://doi.org/10.7151/dmgt.2087 kostenfrei https://doaj.org/toc/2083-5892 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2111 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 39 2019 2 341-355
allfields_unstemmed	10.7151/dmgt.2087 doi (DE-627)DOAJ021229368 (DE-599)DOAJ080b23c3455343fba27d23acf1254744 DE-627 ger DE-627 rakwb eng QA1-939 Bailey Robert F. verfasserin aut Error-Correcting Codes from k-Resolving Sets 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier We 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). error-correcting code k-resolving set k-metric dimension covering design uncovering grid graph 05c12 94b25 05b40 94b35 Mathematics Yero Ismael G. verfasserin aut In Discussiones Mathematicae Graph Theory Sciendo, 2014 39(2019), 2, Seite 341-355 (DE-627)633752266 (DE-600)2568813-3 20835892 nnns volume:39 year:2019 number:2 pages:341-355 https://doi.org/10.7151/dmgt.2087 kostenfrei https://doaj.org/article/080b23c3455343fba27d23acf1254744 kostenfrei https://doi.org/10.7151/dmgt.2087 kostenfrei https://doaj.org/toc/2083-5892 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2111 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 39 2019 2 341-355
allfieldsGer	10.7151/dmgt.2087 doi (DE-627)DOAJ021229368 (DE-599)DOAJ080b23c3455343fba27d23acf1254744 DE-627 ger DE-627 rakwb eng QA1-939 Bailey Robert F. verfasserin aut Error-Correcting Codes from k-Resolving Sets 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier We 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). error-correcting code k-resolving set k-metric dimension covering design uncovering grid graph 05c12 94b25 05b40 94b35 Mathematics Yero Ismael G. verfasserin aut In Discussiones Mathematicae Graph Theory Sciendo, 2014 39(2019), 2, Seite 341-355 (DE-627)633752266 (DE-600)2568813-3 20835892 nnns volume:39 year:2019 number:2 pages:341-355 https://doi.org/10.7151/dmgt.2087 kostenfrei https://doaj.org/article/080b23c3455343fba27d23acf1254744 kostenfrei https://doi.org/10.7151/dmgt.2087 kostenfrei https://doaj.org/toc/2083-5892 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2111 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 39 2019 2 341-355
allfieldsSound	10.7151/dmgt.2087 doi (DE-627)DOAJ021229368 (DE-599)DOAJ080b23c3455343fba27d23acf1254744 DE-627 ger DE-627 rakwb eng QA1-939 Bailey Robert F. verfasserin aut Error-Correcting Codes from k-Resolving Sets 2019 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier We 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). error-correcting code k-resolving set k-metric dimension covering design uncovering grid graph 05c12 94b25 05b40 94b35 Mathematics Yero Ismael G. verfasserin aut In Discussiones Mathematicae Graph Theory Sciendo, 2014 39(2019), 2, Seite 341-355 (DE-627)633752266 (DE-600)2568813-3 20835892 nnns volume:39 year:2019 number:2 pages:341-355 https://doi.org/10.7151/dmgt.2087 kostenfrei https://doaj.org/article/080b23c3455343fba27d23acf1254744 kostenfrei https://doi.org/10.7151/dmgt.2087 kostenfrei https://doaj.org/toc/2083-5892 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2111 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 39 2019 2 341-355
language	English
source	In Discussiones Mathematicae Graph Theory 39(2019), 2, Seite 341-355 volume:39 year:2019 number:2 pages:341-355
sourceStr	In Discussiones Mathematicae Graph Theory 39(2019), 2, Seite 341-355 volume:39 year:2019 number:2 pages:341-355
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	error-correcting code k-resolving set k-metric dimension covering design uncovering grid graph 05c12 94b25 05b40 94b35 Mathematics
isfreeaccess_bool	true
container_title	Discussiones Mathematicae Graph Theory
authorswithroles_txt_mv	Bailey Robert F. @@aut@@ Yero Ismael G. @@aut@@
publishDateDaySort_date	2019-01-01T00:00:00Z
hierarchy_top_id	633752266
id	DOAJ021229368
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ021229368</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230307044628.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230226s2019 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.7151/dmgt.2087</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ021229368</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ080b23c3455343fba27d23acf1254744</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA1-939</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Bailey Robert F.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Error-Correcting Codes from k-Resolving Sets</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">We 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).</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">error-correcting code</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">k-resolving set</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">k-metric dimension</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">covering design</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">uncovering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">grid graph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">05c12</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">94b25</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">05b40</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">94b35</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Mathematics</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Yero Ismael G.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Discussiones Mathematicae Graph Theory</subfield><subfield code="d">Sciendo, 2014</subfield><subfield code="g">39(2019), 2, Seite 341-355</subfield><subfield code="w">(DE-627)633752266</subfield><subfield code="w">(DE-600)2568813-3</subfield><subfield code="x">20835892</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:39</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:2</subfield><subfield code="g">pages:341-355</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.7151/dmgt.2087</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/080b23c3455343fba27d23acf1254744</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.7151/dmgt.2087</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2083-5892</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">39</subfield><subfield code="j">2019</subfield><subfield code="e">2</subfield><subfield code="h">341-355</subfield></datafield></record></collection>
callnumber-first	Q - Science
author	Bailey Robert F.
spellingShingle	Bailey Robert F. misc QA1-939 misc error-correcting code misc k-resolving set misc k-metric dimension misc covering design misc uncovering misc grid graph misc 05c12 misc 94b25 misc 05b40 misc 94b35 misc Mathematics Error-Correcting Codes from k-Resolving Sets
authorStr	Bailey Robert F.
ppnlink_with_tag_str_mv	@@773@@(DE-627)633752266
format	electronic Article
delete_txt_mv	keep
author_role	aut aut
collection	DOAJ
remote_str	true
callnumber-label	QA1-939
illustrated	Not Illustrated
issn	20835892
topic_title	QA1-939 Error-Correcting Codes from k-Resolving Sets error-correcting code k-resolving set k-metric dimension covering design uncovering grid graph 05c12 94b25 05b40 94b35
topic	misc QA1-939 misc error-correcting code misc k-resolving set misc k-metric dimension misc covering design misc uncovering misc grid graph misc 05c12 misc 94b25 misc 05b40 misc 94b35 misc Mathematics
topic_unstemmed	misc QA1-939 misc error-correcting code misc k-resolving set misc k-metric dimension misc covering design misc uncovering misc grid graph misc 05c12 misc 94b25 misc 05b40 misc 94b35 misc Mathematics
topic_browse	misc QA1-939 misc error-correcting code misc k-resolving set misc k-metric dimension misc covering design misc uncovering misc grid graph misc 05c12 misc 94b25 misc 05b40 misc 94b35 misc Mathematics
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Discussiones Mathematicae Graph Theory
hierarchy_parent_id	633752266
hierarchy_top_title	Discussiones Mathematicae Graph Theory
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)633752266 (DE-600)2568813-3
title	Error-Correcting Codes from k-Resolving Sets
ctrlnum	(DE-627)DOAJ021229368 (DE-599)DOAJ080b23c3455343fba27d23acf1254744
title_full	Error-Correcting Codes from k-Resolving Sets
author_sort	Bailey Robert F.
journal	Discussiones Mathematicae Graph Theory
journalStr	Discussiones Mathematicae Graph Theory
callnumber-first-code	Q
lang_code	eng
isOA_bool	true
recordtype	marc
publishDateSort	2019
contenttype_str_mv	txt
container_start_page	341
author_browse	Bailey Robert F. Yero Ismael G.
container_volume	39
class	QA1-939
format_se	Elektronische Aufsätze
author-letter	Bailey Robert F.
doi_str_mv	10.7151/dmgt.2087
author2-role	verfasserin
title_sort	error-correcting codes from k-resolving sets
callnumber	QA1-939
title_auth	Error-Correcting Codes from k-Resolving Sets
abstract	We 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).
abstractGer	We 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).
abstract_unstemmed	We 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).
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2111 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700
container_issue	2
title_short	Error-Correcting Codes from k-Resolving Sets
url	https://doi.org/10.7151/dmgt.2087 https://doaj.org/article/080b23c3455343fba27d23acf1254744 https://doaj.org/toc/2083-5892
remote_bool	true
author2	Yero Ismael G.
author2Str	Yero Ismael G.
ppnlink	633752266
callnumber-subject	QA - Mathematics
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
doi_str	10.7151/dmgt.2087
callnumber-a	QA1-939
up_date	2024-07-03T19:39:53.818Z
_version_	1803588042824351744
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ021229368</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230307044628.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230226s2019 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.7151/dmgt.2087</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ021229368</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ080b23c3455343fba27d23acf1254744</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA1-939</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Bailey Robert F.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Error-Correcting Codes from k-Resolving Sets</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">We 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).</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">error-correcting code</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">k-resolving set</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">k-metric dimension</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">covering design</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">uncovering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">grid graph</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">05c12</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">94b25</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">05b40</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">94b35</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Mathematics</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Yero Ismael G.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Discussiones Mathematicae Graph Theory</subfield><subfield code="d">Sciendo, 2014</subfield><subfield code="g">39(2019), 2, Seite 341-355</subfield><subfield code="w">(DE-627)633752266</subfield><subfield code="w">(DE-600)2568813-3</subfield><subfield code="x">20835892</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:39</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:2</subfield><subfield code="g">pages:341-355</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.7151/dmgt.2087</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/080b23c3455343fba27d23acf1254744</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.7151/dmgt.2087</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2083-5892</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">39</subfield><subfield code="j">2019</subfield><subfield code="e">2</subfield><subfield code="h">341-355</subfield></datafield></record></collection>
score	7.4004126

Nicht das Richtige dabei?

Schreiben Sie uns!

Error-Correcting Codes from k-Resolving Sets

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?