The packing radius of a poset block code
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.
- The packing radius of a code and partitioning problems: the case for poset metrics on finite vector spaces
- On the packing radius and the covering radius of equal-weight codes
- Permutation codes with specified packing radius
- Perfect codes in poset block spaces
- Perfect codes in poset spaces and poset block spaces
- Error-block codes and poset metrics
- Packing densities of randomly constructed codes
- Packing and Covering Properties of Rank Metric Codes
- The weighted coordinates bound and trellis complexity of block codes and periodic packings
- Asymptotic minimum covering radius of block codes
This page was built for publication: The packing radius of a poset block code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2788721)