On the non-existence of perfect codes in the Niederreiter-Rosenbloom-Tsfasman metric

arXiv2302.11738MaRDI QIDQ6427348FDOQ6427348

Authors: Viviana Gubitosi, A. Portela, Claudio Qureshi 

Publication date: 22 February 2023

Abstract: In this paper we consider codes in $mathbb{F}_q^{simesr}$ with packing radius $R$ regarding the NRT-metric (i.e. when the underlying poset is a disjoint union of chains with the same length) and we establish necessary condition on the parameters $s,r$ and $R$ for the existence of perfect codes. More explicitly, for $r,sgeq2$ and $Rgeq1$ we prove that if there is a non-trivial perfect code then $(r+1)(R+1)leqrs$. We also explore a connection to the knapsack problem and establish a correspondence between perfect codes with $r>R$ and those with $r=R$. Using this correspondence we prove the non-existence of non-trivial perfect codes also for $s=R+2$.

This page was built for publication: On the non-existence of perfect codes in the Niederreiter-Rosenbloom-Tsfasman metric

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6427348)