On the Number of t-Lee-Error-Correcting Codes

DOI10.3934/AMC.2023055MaRDI QIDQ6436002zbMATH OpenOpenAlexFDO

Authors Nadja Willenborg, Anna-Lena Horlemann, Violetta Weger

Publication date 9 May 2023

Full work available at URL https://doi.org/10.3934/amc.2023055

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial codes (94B25) Bounds on codes (94B65)

Abstract: We consider $t$-Lee-error-correcting codes of length $n$ over the residue ring $mathbb{Z}_m:=mathbbZ/mmathbbZ$ and determine upper and lower bounds on the number of $t$-Lee-error-correcting codes. We use two different methods, namely estimating isolated nodes on bipartite graphs and the graph container method. The former gives density results for codes of fixed size and the latter for any size. This confirms some recent density results for linear Lee metric codes and provides new density results for nonlinear codes. To apply a variant of the graph container algorithm we also investigate some geometrical properties of the balls in the Lee metric.

Recommendations

• Bounds in the Lee metric and optimal codes
• On some perfect codes with respect to Lee metric
• scientific article; zbMATH DE number 3272069
• On maximum Lee distance codes
• New upper bounds on Lee codes

This page was built for publication: On the Number of $t$-Lee-Error-Correcting Codes

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