activity
20212025
most citedClassification of arcs in

3 citations · 5 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2025

An upper bound on the size of a code with distances

Ivan Landjev, Konstantin Vorobev

Let be a binary code of length with distances . In this note we prove a general upper bound on the size of without any restriction on the distanc…

math.CO2025

A new reducibility results for minihypers in finite projective geometries

Ivan Landjev, Assia Rousseva, Konstantin Vorobev

In this paper we prove a new reducibility result for mini-hypers in projective geometries over finite fields. It is further used to characterize the minihypers with parameters (70,…

math.CO2024★ 1 cited

New Results on Arcs in Projective Hjelmslev Planes over Small Chain Rings

Thomas Honold, Michael Kiermaier, Ivan Landjev

We present various new constructions and bounds for arcs in projective Hjelmslev planes over finite chain rings of nilpotency index 2. For the chain rings of cardinality at most 25…

cs.IT2023

-polycyclic codes in Ore extensions over rings

Maryam Bajalan, Ivan Landjev, Edgar Martínez-Moro +1

In this paper, we study the algebraic structure of -polycyclic codes, defined as submodules in the quotient module , where is the Ore extension ring, $f\i…

math.CO2022★ 1 cited

The Geometry of -arcs

Sascha Kurz, Ivan Landjev, Francesco Pavese +1

In this paper, we give a geometric construction of the three strong non-lifted -arcs in of respective sizes 128, 143, and 168, and construct an…

math.CO2021★ 3 cited

Classification of arcs in

Sascha Kurz, Ivan Landjev, Assia Rousseva

The proof of the non-existence of Griesmer -codes is just one of many examples where extendability results are used. In a series of papers Landjev and Rousseva have…