On some perfect codes with respect to Lee metric

From MaRDI portal
Publication:2484232





In this paper the authors provide bounds on the number of parity check digits for Lee weight codes correcting errors of Lee weight \(1\), errors of Lee weight \(2\) or less, errors of Lee weight \(3\) or less and errors of Lee weight \(4\) or less over \(Z_q\) (\(q\geq 5\), a prime), respectively. They also prove the existence of perfect codes correcting errors of Lee weight \(1\) over \(Z_5\) and perfect codes correcting errors of Lee weight \(2\) or less over \(Z_{13}\). Other nonexistence results are given. Finally, the authors conjecture that does not exist a perfect code correcting errors of Lee weight \(t\) or less (\(t\geq 3\)) over \(Z_q\) (\(q\geq 5\), a prime).




Cited in
(27)








This page was built for publication: On some perfect codes with respect to Lee metric

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