The packing radius of a poset block code (Q2788721)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The packing radius of a poset block code |
scientific article; zbMATH DE number 6543440
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The packing radius of a poset block code |
scientific article; zbMATH DE number 6543440 |
Statements
The packing radius of a poset block code (English)
0 references
22 February 2016
0 references
poset block metric
0 references
packing radius
0 references
partition problem
0 references
0.9223322
0 references
0.89730215
0 references
0.8872253
0 references
0 references
0.8866248
0 references
0 references
0.8786948
0 references
0.8755052
0 references
0.87513727
0 references
0.8750299
0 references
The properties of the packing radius of a code with respect to poset block metric are studied. Some results on the packing radius with respect to poset metric given by \textit{R. G. L. D'Oliveira} and \textit{M. Firer} in their paper [``The packing radius of a code and partitioning problems: The case for poset metrics'', Proc. IEEE Symp. Information Theory, 2954--2958 (2014; \url{doi:10.1109/ISIT.2014.6875375})], are extended to the case of poset block metric. Further two minor errors on the bounds of poset metric discussed in the above paper by D'Oliveira and Firer are also reported by giving two counter examples.
0 references
