| Full text | |
| Author(s): |
Machado, Roberto Assis
;
Pinheiro, Jerry Anderson
;
Firer, Marcelo
Total Authors: 3
|
| Document type: | Journal article |
| Source: | IEEE TRANSACTIONS ON INFORMATION THEORY; v. 63, n. 6, p. 3630-3640, JUN 2017. |
| Web of Science Citations: | 2 |
| Abstract | |
In this paper, we consider metrics determined by hierarchical posets and give explicit formulas for the main parameters of a linear code: the minimum distance and the packing, covering, and Chebyshev radii of a code. We also present ten characterizations of hierarchical poset metrics, including new characterizations and simple new proofs to the known ones. (AU) | |
| FAPESP's process: | 15/11286-8 - Metrics that agree on the support of vectors and nearest neighbor decoding |
| Grantee: | Roberto Assis Machado |
| Support Opportunities: | Scholarships in Brazil - Doctorate |
| FAPESP's process: | 16/01551-9 - Metrics in coding theory |
| Grantee: | Jerry Anderson Pinheiro |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
| FAPESP's process: | 13/25977-7 - Security and reliability of Information: theory and practice |
| Grantee: | Marcelo Firer |
| Support Opportunities: | Research Projects - Thematic Grants |