Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Problemy Peredachi Informatsii, 2011, Volume 47, Issue 3, Pages 3–9 (Mi ppi2050)  

This article is cited in 9 scientific papers (total in 9 papers)

Coding Theory

New $(n,r)$-arcs in $\mathrm{PG}(2,17)$, $\mathrm{PG}(2,19)$, and $\mathrm{PG}(2,23)$

R. Daskalov, E. Metodieva

Department of Mathematics, Technical University of Gabrovo, Bulgaria
Full-text PDF (168 kB) Citations (9)
References:
Abstract: An $(n,r)$-arc is a set of $n$ points of a projective plane such that some $r$ but no $r+1$ of them are collinear. The maximum size of an $(n,r)$-arc in $\mathrm{PG}(2,q)$ is denoted by $m_r(2,q)$. In this paper a new $(95,7)$-arc, $(183,12)$-arc, and $(205,13)$-arc in $\mathrm{PG}(2,17)$ are constructed, as well as a $(243,14)$-arc and $(264,15)$-arc in $\mathrm{PG}(2,19)$. Likewise, good large $(n,r)$-arcs in $\mathrm{PG}(2,23)$ are constructed and a table with bounds on $m_r(2,23)$ is presented. In this way many new 3-dimensional Griesmer codes are obtained. The results are obtained by nonexhaustive local computer search.
Received: 20.05.2010
English version:
Problems of Information Transmission, 2011, Volume 47, Issue 3, Pages 217–223
DOI: https://doi.org/10.1134/S003294601103001X
Bibliographic databases:
Document Type: Article
UDC: 621.391.1+519.7
Language: Russian
Citation: R. Daskalov, E. Metodieva, “New $(n,r)$-arcs in $\mathrm{PG}(2,17)$, $\mathrm{PG}(2,19)$, and $\mathrm{PG}(2,23)$”, Probl. Peredachi Inf., 47:3 (2011), 3–9; Problems Inform. Transmission, 47:3 (2011), 217–223
Citation in format AMSBIB
\Bibitem{DasMet11}
\by R.~Daskalov, E.~Metodieva
\paper New $(n,r)$-arcs in $\mathrm{PG}(2,17)$, $\mathrm{PG}(2,19)$, and~$\mathrm{PG}(2,23)$
\jour Probl. Peredachi Inf.
\yr 2011
\vol 47
\issue 3
\pages 3--9
\mathnet{http://mi.mathnet.ru/ppi2050}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2896172}
\transl
\jour Problems Inform. Transmission
\yr 2011
\vol 47
\issue 3
\pages 217--223
\crossref{https://doi.org/10.1134/S003294601103001X}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000299374700001}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84855968195}
Linking options:
  • https://www.mathnet.ru/eng/ppi2050
  • https://www.mathnet.ru/eng/ppi/v47/i3/p3
  • This publication is cited in the following 9 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:238
    Full-text PDF :56
    References:44
    First page:3
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024