23 research outputs found
Spectral approach to linear programming bounds on codes
Full text linkWe give new proofs of asymptotic upper bounds of coding theory obtained
within the frame of Delsarte's linear programming method. The proofs rely on
the analysis of eigenvectors of some finite-dimensional operators related to
orthogonal polynomials. The examples of the method considered in the paper
include binary codes, binary constant-weight codes, spherical codes, and codes
in the projective spaces.Comment: 11 pages, submitte
Solvability and Construction of a Solution of the Vallée-Poussin Boundary Value Problem for a Nonlinear Second-Order Matrix Lyapunov Equation
No full textParameter identification for a model of a marine vehicle moving periodically under active control
No full textOne modification of a generalized dynamic model of multiply connected regular vibratory systems of cyclic machines
No full textOn decomposition of regular vibration systems of cycle machines incorporating identical ring-structured modules
No full text
