Name
Abstract | ||
|---|---|---|
New bounds on the rate of non-binary codes and non-binary constant weight codes are derived. The asymptotic forms of these bounds outperform known bounds in a wide range of distances. The method is based on analysis of subsets in products of Hamming and Johnson association schemes. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.3934/amc.2007.1.83 | ADVANCES IN MATHEMATICS OF COMMUNICATIONS |
Keywords | Field | DocType |
upper bound | Discrete mathematics,Hamming code,Combinatorics,Association scheme,Upper and lower bounds,Binary code,Mathematics | Journal |
Volume | Issue | ISSN |
1 | 1 | 1930-5346 |
Citations | PageRank | References |
3 | 0.54 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Simon N. Litsyn | 1 | 843 | 106.44 |
| Y. Ben-Haim | 2 | 140 | 8.29 |