Geodesic
Multidimensional permanents in enumrative problems
Diskretnyj analiz i issledovanie operacij, Tome 15 (2008) no. 5, pp. 3-5

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

A permanent is an effective tool that can be used for solving a series of enumerative combinatorial problems. This theory is well-developed [1, 3] and has many applications. In this paper a problem of calculation of the number of 1-perfect binary codes is reduced to calculation of a generalized permanent of a specially constructed multidimensional matrix. Bibl. 3.
Mots-clés : permanent, multidimensional matrix.
Keywords: perfect code 
@article{DA_2008_15_5_a0,
     author = {S. V. Avgustinovich},
     title = {Multidimensional permanents in enumrative problems},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {3--5},
     publisher = {mathdoc},
     volume = {15},
     number = {5},
     year = {2008},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2008_15_5_a0/}
}
TY  - JOUR
AU  - S. V. Avgustinovich
TI  - Multidimensional permanents in enumrative problems
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2008
SP  - 3
EP  - 5
VL  - 15
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2008_15_5_a0/
LA  - ru
ID  - DA_2008_15_5_a0
ER  - 
%0 Journal Article
%A S. V. Avgustinovich
%T Multidimensional permanents in enumrative problems
%J Diskretnyj analiz i issledovanie operacij
%D 2008
%P 3-5
%V 15
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2008_15_5_a0/
%G ru
%F DA_2008_15_5_a0
S. V. Avgustinovich. Multidimensional permanents in enumrative problems. Diskretnyj analiz i issledovanie operacij, Tome 15 (2008) no. 5, pp. 3-5. http://geodesic.mathdoc.fr/item/DA_2008_15_5_a0/