Automorphisms of 2-(22, 8, 4) designs. - Ivan N. Landgev; Vladimir D. Tonchev (Discret. Math., 1989)

The possible support sizes for BIB designs with nu = 8 and k = 4. - A. Hedayat; J. Stufken; Ivan N. Landgev (J. Comb. Theory A, 1989)

On block designs with repeated blocks. - Ivan N. Landgev (Discret. Math., 1992)

On Some Mixed Covering Codes of Small Length. - E. Kolev; Ivan N. Landgev (Algebraic Coding, 1993)

On Maximal Spherical Codes I. - Peter G. Boyvalenkov; Ivan N. Landgev (AAECC, 1995)

On the Binary Codes of Steiner Triple Systems. - Alphonse Baartmans; Ivan N. Landjev; Vladimir D. Tonchev (Des. Codes Cryptogr., 1996)

Constructions of Group Divisible Designs. - Ivan N. Landgev (Des. Codes Cryptogr., 1996)

Optimal Linear Codes of Dimension 4 over GF(5). - Ivan N. Landjev (AAECC, 1997)

The Nonexistence of Some Optimal Ternary Codes of Dimension Five. - Ivan N. Landjev (Des. Codes Cryptogr., 1998)

On the minimum length of quaternary linear codes of dimension five. - Ivan N. Landjev; Tatsuya Maruta (Discret. Math., 1999)

All Reed-Muller Codes Are Linearly Representable over the Ring of Dual Numbers over Z2. - Thomas Honold; Ivan N. Landjev (IEEE Trans. Inf. Theory, 1999)

Linear Codes over Finite Chain Rings. - Thomas Honold; Ivan N. Landjev (Electron. J. Comb., 2000)

Near-MDS codes over some small fields. - Stefan M. Dodunekov; Ivan N. Landjev (Discret. Math., 2000)

Linear codes over finite fields and finite projective geometries. - Ivan N. Landjev (Discret. Math., 2000)

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., 2001)

On arcs in projective Hjelmslev planes. - Thomas Honold; Ivan N. Landjev (Discret. Math., 2001)

The Classification of the Largest Caps in AG(5, 3). - Yves Edel; Sandy Ferret; Ivan N. Landjev; Leo Storme (J. Comb. Theory A, 2002)

On Optimal Codes Over the Field with Five Elements. - Ivan N. Landjev; Assya Rousseva; Tatsuya Maruta; Ray Hill (Des. Codes Cryptogr., 2003)

On the Minimum Size of Some Minihypers and Related Linear Codes. - Tatsuya Maruta; Ivan N. Landjev; Assya Rousseva (Des. Codes Cryptogr., 2005)

On maximal arcs in projective Hjelmslev planes over chain rings of even characteristic. - Thomas Honold; Ivan N. Landjev (Finite Fields Their Appl., 2005)

An extension theorem for arcs and linear codes. - Ivan N. Landjev; Assya Rousseva (Probl. Inf. Transm., 2006)

On blocking sets in projective Hjelmslev planes. - Ivan N. Landjev (Adv. Math. Commun., 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., 2007)

Spreads in Projective Hjelmslev Geometries. - Ivan N. Landjev (AAECC, 2009)

On multiple caps in finite projective spaces. - Yves Edel; Ivan N. Landjev (Des. Codes Cryptogr., 2010)

A study of (x(q + 1), x; 2, q)-minihypers. - Ivan N. Landjev; Leo Storme (Des. Codes Cryptogr., 2010)

Blocking sets of Rédei type in projective Hjelmslev planes. - Ivan N. Landjev; Stoyan Boev (Discret. Math., 2010)

The dual construction for arcs in projective Hjelmslev spaces. - Thomas Honold; Ivan N. Landjev (Adv. Math. Commun., 2011)

Characterization of some optimal arcs. - Ivan N. Landjev; Assya Rousseva (Adv. Math. Commun., 2011)

A study of (xvt, xvt-1)-minihypers in PG(t, q). - Ivan N. Landjev; Peter Vandendriessche (J. Comb. Theory A, 2012)

Non-free extensions of the simplex codes over a chain ring with four elements. - Thomas Honold; Ivan N. Landjev (Des. Codes Cryptogr., 2013)

On t-fold blocking sets in affine spaces and the sharpness of Bruen's bound. - Ivan N. Landjev; Assya Rousseva (Electron. Notes Discret. Math., 2013)

Chain ring analogs of designs. - Ivan N. Landjev; Peter Vandendriessche (Electron. Notes Discret. Math., 2013)

On the sharpness of Bruen's bound for intersection sets in Desarguesian affine spaces. - Ivan N. Landjev; Assya Rousseva (Des. Codes Cryptogr., 2014)

On the rank of incidence matrices in projective Hjelmslev spaces. - Ivan N. Landjev; Peter Vandendriessche (Des. Codes Cryptogr., 2014)

The non-existence of (104, 22;3, 5)-arcs. - Ivan N. Landjev; Assia Rousseva (Adv. Math. Commun., 2016)

On the extendability of quasidivisible Griesmer arcs. - Ivan N. Landjev; Assia Rousseva; Leo Storme (Des. Codes Cryptogr., 2016)

Preface. - Grigory Kabatiansky; Ivan N. Landjev (Electron. Notes Discret. Math., 2017)

On the Sharpness of the Griesmer Bound. - Ivan N. Landjev; Assia Rousseva (Electron. Notes Discret. Math., 2017)

On the Characterization of (3 mod 5) Arcs. - Ivan N. Landjev; Assia Rousseva (Electron. Notes Discret. Math., 2017)

Conditions for the existence of spreads in projective Hjelmslev spaces. - Ivan N. Landjev; Nevyana Georgieva (Des. Codes Cryptogr., 2019)

Linear codes close to the Griesmer bound and the related geometric structures. - Assia Rousseva; Ivan N. Landjev (Des. Codes Cryptogr., 2019)

Divisible Arcs, Divisible Codes, and the Extension Problem for Arcs and Codes. - Ivan N. Landjev; Assya Rousseva (Probl. Inf. Transm., 2019)

New upper bounds on the maximal size of an arc in a projective Hjelmslev plane. - Thomas Honold; Michael Kiermaier; Ivan N. Landjev (ACCT, 2020)

Codes related to caps and the non-existence of some Griesmer codes. - Assia Rousseva; Ivan N. Landjev (ACCT, 2020)

The geometric approach to the existence of some quaternary Griesmer codes. - Assia Rousseva; Ivan N. Landjev (Des. Codes Cryptogr., 2020)

Classification of 3 mod 5 arcs in PG(3, 5). - Sascha Kurz; Ivan N. Landjev; Assia Rousseva (CoRR, 2021)

Classification of $ mathbf{(3 ! mod 5)} $ arcs in $ mathbf{ operatorname{PG}(3,5)} $. - Sascha Kurz; Ivan N. Landjev; Assia Rousseva (Adv. Math. Commun., 2023)

(σ, δ)-polycyclic codes in Ore extensions over rings. - Maryam Bajalan; Ivan N. Landjev; Edgar Martínez-Moro; Steve Szabo (CoRR, 2023)

On homogeneous arcs and linear codes over finite chain rings. - Thomas Honold; Ivan N. Landjev (Appl. Algebra Eng. Commun. Comput., 2023)

Constructions of binary codes with two distances. - Ivan N. Landjev; Assia Rousseva; Konstantin V. Vorob'ev (Discret. Math., 2023)

The geometry of $(t mod q)$-arcs. - Sascha Kurz; Ivan N. Landjev; Francesco Pavese; Assia Rousseva (Des. Codes Cryptogr., 2025)

Sperner's theorem for non-free modules over finite chain rings. - Ivan N. Landjev; Emiliyan Rogachev (Des. Codes Cryptogr., 2025)

An upper bound on the size of a code with s distances. - Ivan N. Landjev; Konstantin V. Vorob'ev (CoRR, 2025)