No label defined (Q3764056)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4021021
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4021021 |
Statements
1986
0 references
Varshamov-Gilbert bound
0 references
n-dimensional codes
0 references
good codes
0 references
large alphabet
0 references
small alphabets
0 references
0.8373536467552185
0 references
0.8270807862281799
0 references
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.
0 references