Name
Abstract | ||
|---|---|---|
We prove that there are infinite families (Ci)i?0 of codes over Fq with polynomial complexity of construction whose relative weights are as close to
$$\frac{{q - 1}}{q}$$
as we want and are such that
$$\mathop {\lim }\limits_{i \to \infty } \frac{{\dim C_i }}{{lengthC_i }} > 0$$
The disparity of these families, which is the limit of the ratio of the maximum weight to the minimum one, is also close to one. The method used is the concatenation process. We give the asymptotic expansion of the behaviour of our families as the relative distance approaches
$$\frac{{q - 1}}{q}$$
. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1007/BF01387197 | Appl. Algebra Eng. Commun. Comput. |
Keywords | Field | DocType |
Linear codes,Asymptotic bounds,Concatenation,Disparity,Weights of codes,Reed-Müller codes | Discrete mathematics,Combinatorics,Asymptotic expansion,Polynomial complexity,Reed–Muller code,Concatenation,Time complexity,Mathematics | Journal |
Volume | Issue | Citations |
3 | 2 | 3 |
PageRank | References | Authors |
1.18 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gilles Lachaud | 1 | 41 | 8.53 |
| Jacques Stern | 2 | 3 | 1.18 |