๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An extremum problem for polynomials related to codes and designs

โœ Scribed by D. V. Gorbachev; V. I. Ivanov

Book ID
110617749
Publisher
SP MAIK Nauka/Interperiodica
Year
2000
Tongue
English
Weight
284 KB
Volume
67
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An extremum problem for polynomials and
An extremum problem for polynomials and bounds for codes with given distance and diameter
โœ G. Fazekas ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 442 KB

this paper, proving first a Lloyd-type theorem we solve an extremum problem for systems of orthogonal polynomials and show how this result can be applied to the estimation of the cardinality of codes with given minimal distance and diameter in polynomial metric spaces. A similar approach has been es

A problem of combinatorial designs relat
A problem of combinatorial designs related to authentication codes
โœ Dingyi Pei ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 433 KB ๐Ÿ‘ 2 views

The strong partially balanced t-designs can be used to construct authentication codes, whose probabilities Pr of successful deception in an optimum spoofing attack of order r for r = 0, 1, . . . , t -1, achieve their information-theoretic lower bounds. In this paper a new family of strong partially