Name
Abstract | ||
|---|---|---|
We give a simple lower bound for the dimensions of the families of polynomially constructible spherical codes of given minimal angle , deduced from the analog of the Katsman-Tsfasman-Vldut bound for linear codes. In particular the supremum pol of the numbers log2 CardX/ dim X, where X ranges over all polynomially constructible families of spherical codes with /3, is such that pol2/15. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1007/3-540-54522-0_110 | AAECC |
Keywords | Field | DocType |
spherical codes,polynomial-time construction,polynomial time,linear code,lower bound | Discrete mathematics,Combinatorics,Upper and lower bounds,Low-density parity-check code,Polynomial code,Cyclic code,Infimum and supremum,Reed–Solomon error correction,Linear code,Hamming bound,Mathematics | Conference |
Volume | ISSN | ISBN |
539 | 0302-9743 | 3-540-54522-0 |
Citations | PageRank | References |
1 | 0.67 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gilles Lachaud | 1 | 41 | 8.53 |
| Jacques Stern | 2 | 876 | 93.45 |