scientific article; zbMATH DE number 4021021

From MaRDI portal
Publication:3764056





Let \({\mathcal C}_ L(n,d,q)\) denote the class of n-dimensional codes over an alphabet of size q with minimal code distance d in the Lee-metric. In this paper we propose a procedure for constructing a code \[ C\in {\mathcal C}_ L(n,\quad \min_{1\leq i\leq s}(q_ 1q_ 2...q_{i-1}d_ i),\quad q_ 1q_ 2...q_ s) \] by combining codes \(C_ i\in {\mathcal C}_ L(n,d_ i,q_ i)\), \(i=1\),..., s. This permits us to find good codes over a large alphabet by making use of good codes over small alphabets.











This page was built for publication:

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