Volume 15, No 5, 2008, P. 3-5

UDC 621.391.15
S. V. Avgustinovich
Multidimensional permanents in enumrative problems

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.

Keywords: Permanent, perfect code, multidimensional matrix.

Avgustinovich Sergey Vladimirovich 1
1. S. L. Sobolev Institute of Mathematics, SB RAS,
4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
e-mail: avgust@math.nsc.ru

 © Sobolev Institute of Mathematics, 2015