Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/6348
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kovačević, Marko | en |
dc.contributor.author | Vukobratović, Dejan | en |
dc.date.accessioned | 2019-09-30T08:54:27Z | - |
dc.date.available | 2019-09-30T08:54:27Z | - |
dc.date.issued | 2015-01-01 | en |
dc.identifier.issn | 9251022 | en |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/6348 | - |
dc.description.abstract | © 2013, Springer Science+Business Media New York. We study the problem of existence of (nontrivial) perfect codes in the discrete n-simplex Δnℓ ≔ {(x0,...,xn): xi ∈ ℤ+, ∑i xi = ℓ} under ℓ1 metric. The problem is motivated by the so-called multiset codes, which have recently been introduced by the authors as appropriate constructs for error correction in the permutation channels. It is shown that e-perfect codes in the 1-simplex Δ1ℓ exist for any ℓ ≥ 2e + 1, the 2-simplex Δ2ℓ admits an e-perfect code if and only if ℓ = 3e + 1, while there are no perfect codes in higher-dimensional simplices. In other words, perfect multiset codes exist only over binary and ternary alphabets. | en |
dc.relation.ispartof | Designs, Codes, and Cryptography | en |
dc.title | Perfect codes in the discrete simplex | en |
dc.type | Journal/Magazine Article | en |
dc.identifier.doi | 10.1007/s10623-013-9893-5 | en |
dc.identifier.scopus | 2-s2.0-84925289660 | en |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/84925289660 | en |
dc.relation.lastpage | 95 | en |
dc.relation.firstpage | 81 | en |
dc.relation.issue | 1 | en |
dc.relation.volume | 75 | en |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
crisitem.author.dept | Fakultet tehničkih nauka, Departman za energetiku, elektroniku i telekomunikacije | - |
crisitem.author.parentorg | Fakultet tehničkih nauka | - |
Appears in Collections: | FTN Publikacije/Publications |
SCOPUSTM
Citations
13
checked on May 3, 2024
Page view(s)
26
Last Week
7
7
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.