Diskretnyi Analiz i Issledovanie Operatsii
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


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2006, Volume 13, Issue 4, Pages 49–59 (Mi da11)  
This article is cited in 9 scientific papers (total in 9 papers)

A lower bound for the number of transitive perfect codes

V. N. Potapov

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Full-text PDF (253 kB) Citations (9)
References:
PDF
HTML
Abstract: We construct at least $\dfrac1{8n^2\sqrt3}e^{\pi\sqrt{2n/3}}(1+o(1))$ pairwise nonequivalent transitive extended perfect codes of length $4n$ as $n\to\infty$.
English version:
Journal of Applied and Industrial Mathematics, 2007, Volume 1, Issue 3, Pages 373–379
DOI: https://doi.org/10.1134/S199047890703012X
Bibliographic databases:
Language: Russian
Citation: V. N. Potapov, “A lower bound for the number of transitive perfect codes”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:4 (2006), 49–59; J. Appl. Industr. Math., 1:3 (2007), 373–379
Citation in format AMSBIB
\Bibitem{Pot06}
\by V.~N.~Potapov
\paper A lower bound for the number of transitive perfect codes
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 2006
\vol 13
\issue 4
\pages 49--59
\mathnet{http://mi.mathnet.ru/da11}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2289378}
\zmath{https://zbmath.org/?q=an:1249.94061}
\transl
\jour J. Appl. Industr. Math.
\yr 2007
\vol 1
\issue 3
\pages 373--379
\crossref{https://doi.org/10.1134/S199047890703012X}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-34548686594}
Linking options:
  • https://www.mathnet.ru/eng/da11
  • https://www.mathnet.ru/eng/da/v13/s1/i4/p49
    • 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
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:454
    Full-text PDF :98
    References:55
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024