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

Combinatorial characterization of hexagonal systems

โœ Scribed by Antonije D. Javanovic

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
756 KB
Volume
19
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Combinatorial Characterization of Some
A Combinatorial Characterization of Some Finite Classical Generalized Hexagons
โœ E Govaert ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 280 KB

We characterize the Moufang hexagons in characteristic 2 by requiring that certain sets of points (defined by distances from other objects) are nonempty. Together with a known result for quadrangles, we obtain a common combinatorial characterization of the symplectic quadrangles over an arbitrary fi

A combinatorial characterization of quad
A combinatorial characterization of quadrics
โœ Osvaldo Ferri; Stefania Ferri; Stefano Innamorati ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Springer ๐ŸŒ English โš– 250 KB
Combinatorial characterizations of authe
Combinatorial characterizations of authentication codes
โœ D. R. Stinson ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Springer ๐ŸŒ English โš– 536 KB

In this paper, we prove two new combinatorial characterizations of authentication codes. Authentication codes without secrecy are characterized in terms of orthogonal arrays; and general authentication codes are characterized in terms of balanced incomplete block designs. In both of these characteri