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 |
|---|---|---|
2006 | 10.1109/ISIT.2006.261601 | 2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS |
Keywords | Field | DocType |
constant weight code,codes,linear programming,hamming weight,entropy,upper bound,association scheme | Hamming code,Discrete mathematics,Combinatorics,Hamming(7,4),Block code,Expander code,Hamming distance,Linear code,Reed–Muller code,Hamming bound,Mathematics | Conference |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Y. Ben-Haim | 1 | 140 | 8.29 |
| Simon N. Litsyn | 2 | 843 | 106.44 |