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


Probl. Peredachi Inf., 2002, Volume 38, Issue 1, Pages 59–63 (Mi ppi1300)  

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

Coding Theory

New One-Generator Quasi-cyclic Codes over $GF(7)$

R. Daskalov, P. Khristov


Abstract: Let $[n,k,d]_q$ codes be linear codes of length $n$, dimension $k$, and minimum Hamming distance $d$ over $GF(q)$. In this paper, seventeen new codes are constructed, which improve the known lower bounds on minimum distance.

Full text: PDF file (336 kB)
References: PDF file   HTML file

English version:
Problems of Information Transmission, 2002, 38:1, 50–54

Bibliographic databases:

UDC: 621.391.15
Received: 04.10.2001

Citation: R. Daskalov, P. Khristov, “New One-Generator Quasi-cyclic Codes over $GF(7)$”, Probl. Peredachi Inf., 38:1 (2002), 59–63; Problems Inform. Transmission, 38:1 (2002), 50–54

Citation in format AMSBIB
\Bibitem{DasHri02}
\by R.~Daskalov, P.~Khristov
\paper New One-Generator Quasi-cyclic Codes over $GF(7)$
\jour Probl. Peredachi Inf.
\yr 2002
\vol 38
\issue 1
\pages 59--63
\mathnet{http://mi.mathnet.ru/ppi1300}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2101312}
\zmath{https://zbmath.org/?q=an:1027.94023}
\transl
\jour Problems Inform. Transmission
\yr 2002
\vol 38
\issue 1
\pages 50--54
\crossref{https://doi.org/10.1023/A:1020094206873}


Linking options:
  • http://mi.mathnet.ru/eng/ppi1300
  • http://mi.mathnet.ru/eng/ppi/v38/i1/p59

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Daskalov R., Hristov P., “New binary one-generator quasi-cyclic codes”, IEEE Trans. Inform. Theory, 49:11 (2003), 3001–3005  crossref  mathscinet  zmath  isi
    2. Daskalov R., Hristov P., “New quasi-twisted degenerate ternary linear codes”, IEEE Trans. Inform. Theory, 49:9 (2003), 2259–2263  crossref  mathscinet  zmath  isi
    3. R. N. Daskalov, P. V. Hristov, “New Quasi-Cyclic Degenerate Linear Codes over $GF(8)$”, Problems Inform. Transmission, 39:2 (2003), 184–190  mathnet  crossref  mathscinet  zmath
    4. Daskalov R., Hristov P., Metodieva E., “New minimum distance bounds for linear codes over GF(5)”, Discrete Math., 275:1-3 (2004), 97–110  crossref  mathscinet  zmath  isi
    5. R. N. Daskalov, E. Metodieva, P. V. Hristov, “New Minimum Distance Bounds for Linear Codes over $GF(9)$”, Problems Inform. Transmission, 40:1 (2004), 13–24  mathnet  crossref  mathscinet  zmath
    6. R. N. Daskalov, “Some High Rate Linear Codes over $GF(5)$ and $GF(7)$”, Problems Inform. Transmission, 43:2 (2007), 124–131  mathnet  crossref  mathscinet  zmath  isi
    7. D. I. Koshelev, “Non-split toric codes”, Problems Inform. Transmission, 55:2 (2019), 124–144  mathnet  crossref  crossref  isi  elib
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:332
    Full text:127
    References:33

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020