Name
Abstract | ||
|---|---|---|
For self-dual codes with all weights divisible by an integer greater than one, the minimum distance is bounded by the Mallows-Sloane upper bounds and by their improvements due to Krasikov-Litsyn and Rains. We obtain the improved upper bounds from short relations with constant coefficients on suitable binomial moments of the codes. In this approach, the Mallows-Sloane bounds are analogues of the Singleton bound and the improved bounds are analogues of the Plotkin bound. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1504/IJICOT.2010.032134 | IJICoT |
Keywords | Field | DocType |
minimum distance,improved bound,constant coefficient,weights divisible,improved upper bound,self-dual code,short relation,suitable binomial moment,mallows-sloane upper bound,divisible self-dual code,mallows-sloane bound | Integer,Discrete mathematics,Plotkin bound,Combinatorics,Binomial,Constant coefficients,Linear code,Mathematics,Singleton bound,Bounded function | Journal |
Volume | Issue | Citations |
1 | 2 | 0 |
PageRank | References | Authors |
0.34 | 4 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Iwan M. Duursma | 1 | 279 | 26.85 |