Name
Title | ||
|---|---|---|
The packing radius of a code and partitioning problems: The case for poset metrics on finite vector spaces |
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.disc.2015.05.011 | Discrete Mathematics |
Keywords | Field | DocType |
Error correction codes,Poset codes | Partition problem,Discrete mathematics,Combinatorics,Disjoint sets,Hierarchy,Code (cryptography),Partially ordered set,Mathematics | Journal |
Volume | Issue | ISSN |
338 | 12 | 0012-365X |
Citations | PageRank | References |
2 | 0.41 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rafael Gregorio Lucas D'Oliveira | 1 | 18 | 3.43 |
| Marcelo Firer | 2 | 85 | 18.24 |