Gerzson Kéri

发表

Types of superregular matrices and the number of n‐arcs and complete n‐arcs in PG (r, q)

Gerzson Kéri, 2006 .

Types of superregular matrices and the sizes of complete arcs in PG(r, q), q<=19, 2<=r<=q-2. (Working paper of the Laboratory of Operations Research and Decision Systems. (LORDS) WP04-6)

Gerzson Kéri, 2004 .

The number of inequivalent optimal covering codes.

Patric R. J. Östergård, Gerzson Kéri, P. Östergård, 2006 .

The Sherman-Morrison formula for the determinant and its application for optimizing quadratic functions on condition sets given by extreme generators

Gerzson Kéri, Gerzson Kéri, 2001 .

Covering and radius-covering arrays: Constructions and classification

Charles J. Colbourn, Gerzson Kéri, Jan-Christoph Schlage-Puchta, 2010, Discret. Appl. Math..

On the minimum size of binary codes with length 2R + 4 and covering radius R

Patric R. J. Östergård, Gerzson Kéri, P. Östergård, 2008, Des. Codes Cryptogr..

The Number of Inequivalent (2R + 3, 7)R Optimal Covering Codes

Patric R. J. Östergård, Gerzson Kéri, P. Östergård, 2006 .

On Computing the Hamming Distance

Gerzson Kéri, Ákos Kisvölcsey, Gerzson Kéri, 2004, Acta Cybern..

On the normality of (non-mixed and mixed) optimal covering codes

Gerzson Kéri, Gerzson Kéri, 2010 .

Classification results for non-mixed and mixed optimal covering codes: a survey

Gerzson Kéri, Gerzson Kéri, 2010 .

Further results on the covering radius of small codes

Patric R. J. Östergård, Gerzson Kéri, P. Östergård, 2007, Discret. Math..

Binary Covering Arrays and Existentially Closed Graphs

Charles J. Colbourn, Gerzson Kéri, C. Colbourn, 2009, IWCC.