Geodesic
An extremum problem for polynomials related to codes and designs
Matematičeskie zametki, Tome 67 (2000) no. 4, pp. 508-513.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{MZM_2000_67_4_a3,
     author = {D. V. Gorbachev and V. I. Ivanov},
     title = {An extremum problem for polynomials related to codes and designs},
     journal = {Matemati\v{c}eskie zametki},
     pages = {508--513},
     publisher = {mathdoc},
     volume = {67},
     number = {4},
     year = {2000},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2000_67_4_a3/}
}
TY  - JOUR
AU  - D. V. Gorbachev
AU  - V. I. Ivanov
TI  - An extremum problem for polynomials related to codes and designs
JO  - Matematičeskie zametki
PY  - 2000
SP  - 508
EP  - 513
VL  - 67
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_2000_67_4_a3/
LA  - ru
ID  - MZM_2000_67_4_a3
ER  - 
%0 Journal Article
%A D. V. Gorbachev
%A V. I. Ivanov
%T An extremum problem for polynomials related to codes and designs
%J Matematičeskie zametki
%D 2000
%P 508-513
%V 67
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_2000_67_4_a3/
%G ru
%F MZM_2000_67_4_a3
D. V. Gorbachev; V. I. Ivanov. An extremum problem for polynomials related to codes and designs. Matematičeskie zametki, Tome 67 (2000) no. 4, pp. 508-513. http://geodesic.mathdoc.fr/item/MZM_2000_67_4_a3/

[1] Yudin V. A., “Kod i dizain”, Diskretnaya matem., 9:2 (1997), 3–11 | MR | Zbl

[2] Sege G., Ortogonalnye mnogochleny, Fizmatgiz, M., 1962

[3] Krylov V. I., Priblizhennoe vychislenie integralov, Fizmatgiz, M., 1959

[4] Levenshtein V. I., “Granitsy dlya upakovok metricheskikh prostranstv i nekotorye ikh prilozheniya”, Problemy kibernetiki, 40 (1983), 43–110 | MR

[5] Gasper G., “Linearization of the product of Jacobi polynomials, I”, Canad. J. Math., 2:1 (1970), 171–175 | MR

[6] Levenshtein V. I., “On designs in compact metric spaces and a universal bound on their size”, Discrete Math., 192 (1998), 251–271 | DOI | MR | Zbl