Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIvan N. Landjev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j43]Thomas Honold, Ivan N. Landjev:
On homogeneous arcs and linear codes over finite chain rings. Appl. Algebra Eng. Commun. Comput. 34(3): 359-375 (2023)- [j42]Sascha Kurz, Ivan N. Landjev, Assia Rousseva:
Classification of $ \mathbf{(3 \!\mod 5)} $ arcs in $ \mathbf{ \operatorname{PG}(3,5)} $. Adv. Math. Commun. 17(1): 172-206 (2023) - [j41]Ivan N. Landjev
, Assia Rousseva, Konstantin V. Vorob'ev:
Constructions of binary codes with two distances. Discret. Math. 346(6): 113337 (2023) - 2020
- [j40]Assia Rousseva, Ivan N. Landjev:
The geometric approach to the existence of some quaternary Griesmer codes. Des. Codes Cryptogr. 88(9): 1925-1940 (2020) - 2019
- [j39]Ivan N. Landjev, Nevyana Georgieva:
Conditions for the existence of spreads in projective Hjelmslev spaces. Des. Codes Cryptogr. 87(4): 785-794 (2019) - [j38]Assia Rousseva, Ivan N. Landjev:
Linear codes close to the Griesmer bound and the related geometric structures. Des. Codes Cryptogr. 87(4): 841-854 (2019) - [j37]Ivan N. Landjev, Assya Rousseva:
Divisible Arcs, Divisible Codes, and the Extension Problem for Arcs and Codes. Probl. Inf. Transm. 55(3): 226-240 (2019) - 2017
- [j36]Grigory Kabatiansky, Ivan N. Landjev:
Preface. Electron. Notes Discret. Math. 57: 1-2 (2017) - [j35]Ivan N. Landjev, Assia Rousseva:
On the Sharpness of the Griesmer Bound. Electron. Notes Discret. Math. 57: 147-152 (2017) - [j34]Ivan N. Landjev, Assia Rousseva:
On the Characterization of (3 mod 5) Arcs. Electron. Notes Discret. Math. 57: 187-192 (2017) - 2016
- [j33]Ivan N. Landjev, Assia Rousseva:
The non-existence of (104, 22;3, 5)-arcs. Adv. Math. Commun. 10(3): 601-611 (2016) - [j32]Ivan N. Landjev, Assia Rousseva, Leo Storme:
On the extendability of quasidivisible Griesmer arcs. Des. Codes Cryptogr. 79(3): 535-547 (2016) - 2014
- [j31]Ivan N. Landjev, Assya Rousseva:
On the sharpness of Bruen's bound for intersection sets in Desarguesian affine spaces. Des. Codes Cryptogr. 72(3): 551-558 (2014) - [j30]Ivan N. Landjev, Peter Vandendriessche:
On the rank of incidence matrices in projective Hjelmslev spaces. Des. Codes Cryptogr. 73(2): 615-623 (2014) - 2013
- [j29]Thomas Honold, Ivan N. Landjev:
Non-free extensions of the simplex codes over a chain ring with four elements. Des. Codes Cryptogr. 66(1-3): 27-38 (2013) - [j28]Ivan N. Landjev, Peter Vandendriessche:
Chain ring analogs of designs. Electron. Notes Discret. Math. 40: 211-215 (2013) - [j27]Ivan N. Landjev, Assya Rousseva:
On t-fold blocking sets in affine spaces and the sharpness of Bruen's bound. Electron. Notes Discret. Math. 40: 329-333 (2013) - 2012
- [j26]Ivan N. Landjev, Peter Vandendriessche:
A study of (xvt, xvt-1)-minihypers in PG(t, q). J. Comb. Theory, Ser. A 119(6): 1123-1131 (2012) - 2011
- [j25]Thomas Honold, Ivan N. Landjev:
The dual construction for arcs in projective Hjelmslev spaces. Adv. Math. Commun. 5(1): 11-21 (2011) - [j24]Ivan N. Landjev, Assya Rousseva:
Characterization of some optimal arcs. Adv. Math. Commun. 5(2): 317-331 (2011) - 2010
- [j23]Ivan N. Landjev, Leo Storme:
A study of (x(q + 1), x; 2, q)-minihypers. Des. Codes Cryptogr. 54(2): 135-147 (2010) - [j22]Yves Edel, Ivan N. Landjev:
On multiple caps in finite projective spaces. Des. Codes Cryptogr. 56(2-3): 163-175 (2010) - [j21]Ivan N. Landjev, Stoyan Boev:
Blocking sets of Rédei type in projective Hjelmslev planes. Discret. Math. 310(15-16): 2061-2068 (2010) - 2007
- [j20]Ivan N. Landjev:
On blocking sets in projective Hjelmslev planes. Adv. Math. Commun. 1(1): 65-81 (2007) - [j19]Ivan N. Landjev, Leo Storme:
A weighted version of a result of Hamada on minihypers and on linear codes meeting the Griesmer bound. Des. Codes Cryptogr. 45(1): 123-138 (2007) - 2006
- [j18]Ivan N. Landjev, Assya Rousseva:
An extension theorem for arcs and linear codes. Probl. Inf. Transm. 42(4): 319-329 (2006) - 2005
- [j17]Tatsuya Maruta, Ivan N. Landjev, Assya Rousseva:
On the Minimum Size of Some Minihypers and Related Linear Codes. Des. Codes Cryptogr. 34(1): 5-15 (2005) - [j16]Thomas Honold, Ivan N. Landjev:
On maximal arcs in projective Hjelmslev planes over chain rings of even characteristic. Finite Fields Their Appl. 11(2): 292-304 (2005) - 2003
- [j15]Ivan N. Landjev, Assya Rousseva, Tatsuya Maruta, Ray Hill:
On Optimal Codes Over the Field with Five Elements. Des. Codes Cryptogr. 29(1-3): 165-175 (2003) - 2002
- [j14]Yves Edel, Sandy Ferret, Ivan N. Landjev, Leo Storme:
The Classification of the Largest Caps in AG(5, 3). J. Comb. Theory, Ser. A 99(1): 95-110 (2002) - 2001
- [j13]Simeon Ball, Ray Hill, Ivan N. Landjev, Harold N. Ward:
On (q2+q+2, q+2)-arcs in the Projective Plane PG(2, q). Des. Codes Cryptogr. 24(2): 205-224 (2001) - [j12]Thomas Honold, Ivan N. Landjev:
On arcs in projective Hjelmslev planes. Discret. Math. 231(1-3): 265-278 (2001) - 2000
- [j11]Thomas Honold, Ivan N. Landjev:
Linear Codes over Finite Chain Rings. Electron. J. Comb. 7 (2000) - [j10]Stefan M. Dodunekov, Ivan N. Landjev:
Near-MDS codes over some small fields. Discret. Math. 213(1-3): 55-65 (2000) - [j9]Ivan N. Landjev:
Linear codes over finite fields and finite projective geometries. Discret. Math. 213(1-3): 211-244 (2000) - 1999
- [j8]Ivan N. Landjev, Tatsuya Maruta:
On the minimum length of quaternary linear codes of dimension five. Discret. Math. 202(1-3): 145-161 (1999) - [j7]Thomas Honold, Ivan N. Landjev:
All Reed-Muller Codes Are Linearly Representable over the Ring of Dual Numbers over Z2. IEEE Trans. Inf. Theory 45(2): 700-701 (1999) - 1998
- [j6]Ivan N. Landjev:
The Nonexistence of Some Optimal Ternary Codes of Dimension Five. Des. Codes Cryptogr. 15(3): 245-258 (1998) - 1996
- [j5]Alphonse Baartmans, Ivan N. Landjev, Vladimir D. Tonchev:
On the Binary Codes of Steiner Triple Systems. Des. Codes Cryptogr. 8(1-2): 29-43 (1996) - [j4]Ivan N. Landgev:
Constructions of Group Divisible Designs. Des. Codes Cryptogr. 8(3): 309-318 (1996) - 1992
- [j3]Ivan N. Landgev:
On block designs with repeated blocks. Discret. Math. 106-107: 317-328 (1992) - 1989
- [j2]Ivan N. Landgev, Vladimir D. Tonchev:
Automorphisms of 2-(22, 8, 4) designs. Discret. Math. 77(1-3): 177-189 (1989) - [j1]A. Hedayat, J. Stufken, Ivan N. Landgev:
The possible support sizes for BIB designs with nu = 8 and k = 4. J. Comb. Theory, Ser. A 51(2): 258-267 (1989)
Conference and Workshop Papers
- 2020
- [c6]Thomas Honold, Michael Kiermaier, Ivan N. Landjev:
New upper bounds on the maximal size of an arc in a projective Hjelmslev plane. ACCT 2020: 1-10 - [c5]Assia Rousseva, Ivan N. Landjev:
Codes related to caps and the non-existence of some Griesmer codes. ACCT 2020: 123-127 - 2009
- [c4]Ivan N. Landjev:
Spreads in Projective Hjelmslev Geometries. AAECC 2009: 186-194 - 1997
- [c3]Ivan N. Landjev:
Optimal Linear Codes of Dimension 4 over GF(5). AAECC 1997: 212-220 - 1995
- [c2]Peter G. Boyvalenkov, Ivan N. Landgev:
On Maximal Spherical Codes I. AAECC 1995: 158-168 - 1993
- [c1]E. Kolev, Ivan N. Landgev:
On Some Mixed Covering Codes of Small Length. Algebraic Coding 1993: 38-50
Informal and Other Publications
- 2021
- [i1]Sascha Kurz, Ivan N. Landjev, Assia Rousseva:
Classification of 3 mod 5 arcs in PG(3, 5). CoRR abs/2108.04871 (2021)
Coauthor Index
aka: Assia Rousseva
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
