EDBT 2026 Demo / reviewers in the wild / expert
Ivan N. Landjev
dblp:97/4129 · also Ivan N. Landgev
· DBLP profile ↗
22ranked-venue papers
13as first author
5since 2021 · last 2026
0000-0001-5147-5186ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 21 · 13 first-author · 5 since 2021Theory of computation · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Characterization of some minihypers in ${{\,\textrm{PG}\,}}(r,3)$ and the nonexistence of some ternary Griesmer codes
Ivan N. Landjev, Emiliyan Rogachev, Assya Rousseva |
Des. Codes Cryptogr. | 1 |
| 2026 | On the reducibility of minihypers
Ivan N. Landjev, Assya Rousseva, Leo Storme |
Des. Codes Cryptogr. | 1 |
| 2025 | The geometry of $(t\mod q)$-arcsabstractAbstract In this paper, we give a geometric construction of the three strong non-lifted $$(3\mod 5)$$ ( 3 mod 5 ) -arcs in $${{\,\textrm{PG}\,}}(3,5)$$ PG ( 3 , 5 ) of respective sizes 128, 143, and 168, and construct an infinite family of non-lifted, strong $$(t\mod q)$$ ( t mod q ) -arcs in $${{\,\textrm{PG}\,}}(r,q)$$ PG ( r , q ) with $$t=(q+1)/2$$ t = ( q + 1 ) / 2 for all $$r\ge 3$$ r ≥ 3 and all odd prime powers q. Sascha Kurz, Ivan N. Landjev, Francesco Pavese, Assya Rousseva |
Des. Codes Cryptogr. | 2 |
| 2025 | Sperner's theorem for non-free modules over finite chain rings
Ivan N. Landjev, Emiliyan Rogachev |
Des. Codes Cryptogr. | 1 |
| 2025 | On binary codes with distances d and d+2
Ivan N. Landjev, Konstantin V. Vorob'ev |
Des. Codes Cryptogr. | 1 |
| 2020 | The geometric approach to the existence of some quaternary Griesmer codes
Assya Rousseva, Ivan N. Landjev |
Des. Codes Cryptogr. | 2 |
| 2019 | Conditions for the existence of spreads in projective Hjelmslev spaces
Ivan N. Landjev, Nevyana Georgieva |
Des. Codes Cryptogr. | 1 |
| 2019 | Linear codes close to the Griesmer bound and the related geometric structures
Assya Rousseva, Ivan N. Landjev |
Des. Codes Cryptogr. | 2 |
| 2016 | On the extendability of quasidivisible Griesmer arcs
Ivan N. Landjev, Assya Rousseva, Leo Storme |
Des. Codes Cryptogr. | 1 |
| 2014 | On the sharpness of Bruen's bound for intersection sets in Desarguesian affine spaces
Ivan N. Landjev, Assya Rousseva |
Des. Codes Cryptogr. | 1 |
| 2014 | On the rank of incidence matrices in projective Hjelmslev spaces
Ivan N. Landjev, Peter Vandendriessche |
Des. Codes Cryptogr. | 1 |
| 2013 | Non-free extensions of the simplex codes over a chain ring with four elements
Thomas Honold, Ivan N. Landjev |
Des. Codes Cryptogr. | 2 |
| 2010 | On multiple caps in finite projective spaces
Yves Edel, Ivan N. Landjev |
Des. Codes Cryptogr. | 2 |
| 2010 | A study of (x(q + 1), x; 2, q)-minihypers
Ivan N. Landjev, Leo Storme |
Des. Codes Cryptogr. | 1 |
| 2007 | A weighted version of a result of Hamada on minihypers and on linear codes meeting the Griesmer bound
Ivan N. Landjev, Leo Storme |
Des. Codes Cryptogr. | 1 |
| 2005 | On the Minimum Size of Some Minihypers and Related Linear Codes
Tatsuya Maruta, Ivan N. Landjev, Assya Rousseva |
Des. Codes Cryptogr. | 2 |
| 2003 | On Optimal Codes Over the Field with Five Elements
Ivan N. Landjev, Assya Rousseva, Tatsuya Maruta, Ray Hill |
Des. Codes Cryptogr. | 1 |
| 2001 | On (q2+q+2, q+2)-arcs in the Projective Plane PG(2, q)
Simeon Ball, Ray Hill, Ivan N. Landjev, Harold N. Ward |
Des. Codes Cryptogr. | 3 |
| 1999 | All Reed-Muller Codes Are Linearly Representable over the Ring of Dual Numbers over Z2abstractThe statement given in the title is proved. Linear codes over chain rings (commutative and noncommutative) are a natural generalization of linear codes over finite fields and of linear codes over integer residue class rings of prime power order. In matters of linear representability there is no obvious reason why we should prefer one chain ring to the other. Yet, apart from Z/sub 4/, there is one further nontrivial chain ring with four elements: the ring Z/sub 2/[x]/(x/sup 2/) of dual numbers over Z/sub 2/. It is natural to ask about the linear representability of the Reed-Muller codes over this ring. For the sake of completeness, we reformulate here in an obvious way the definition of a linearly representable code. Thomas Honold, Ivan N. Landjev |
IEEE Trans. Inf. Theory | 2 |
| 1998 | The Nonexistence of Some Optimal Ternary Codes of Dimension Five
Ivan N. Landjev |
Des. Codes Cryptogr. | 1 |
| 1996 | On the Binary Codes of Steiner Triple Systems
Alphonse Baartmans, Ivan N. Landjev, Vladimir D. Tonchev |
Des. Codes Cryptogr. | 2 |
| 1996 | Constructions of Group Divisible Designs
Ivan N. Landjev |
Des. Codes Cryptogr. | 1 |