Metrics that agree on the support of vectors and nearest neighbor decoding
| Full text | |
| Author(s): |
Total Authors: 2
|
| Affiliation: | [1] Univ Estadual Campinas, IMECC UNICAMP, BR-13083859 Campinas, SP - Brazil
Total Affiliations: 1
|
| Document type: | Journal article |
| Source: | DISCRETE MATHEMATICS; v. 338, n. 12, p. 2143-2167, DEC 6 2015. |
| Web of Science Citations: | 8 |
| Abstract | |
Until this work, the packing radius of a poset code was only known in the cases where the poset was a chain, a hierarchy, a union of disjoint chains of the same size, and for some families of codes. Our objective is to approach the general case of any poset. To do this, we will divide the problem into two parts. The first part consists in finding the packing radius of a single vector. We will show that this is equivalent to a generalization of a well known NP-hard problem known as ``the partition problem{''}. Then, we will review the main results known about this problem giving special attention to the algorithms to solve it. The main ingredient to these algorithms is what is known as the differentiating method, which we will extend to the general case. The second part consists in finding the vector that determines the packing radius of the code. For this, we will show how it is sometimes possible to compare the packing radius of two vectors without calculating them explicitly. (C) 2015 Elsevier B.V. All rights reserved. (AU) | |
| FAPESP's process: | 13/25977-7 - Security and reliability of Information: theory and practice |
| Grantee: | Marcelo Firer |
| Support Opportunities: | Research Projects - Thematic Grants |