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, 1984, Volume 20, Issue 1, Pages 3–11 (Mi ppi1116)  

Coding Theory

On Shortening of Codes

V. A. Zinov'ev, S. N. Litsyn
Abstract: The authors obtain some new bounds for the dual distance of generalized concatenated codes and BCH codes. The use of these bounds in the existing code-shortening arrangements leads to a number of new codes with optimal parameters. A new construction is proposed for shortening arbitrary (linear and nonlinear) codes. Application of this construction to existing codes yields a large number of codes with optimal known parameters.
Received: 17.04.1982
Bibliographic databases:
Document Type: Article
UDC: 621.391.15:519.72
Language: Russian
Citation: V. A. Zinov'ev, S. N. Litsyn, “On Shortening of Codes”, Probl. Peredachi Inf., 20:1 (1984), 3–11; Problems Inform. Transmission, 20:1 (1984), 1–7
Citation in format AMSBIB
\Bibitem{ZinLit84}
\by V.~A.~Zinov'ev, S.~N.~Litsyn
\paper On Shortening of Codes
\jour Probl. Peredachi Inf.
\yr 1984
\vol 20
\issue 1
\pages 3--11
\mathnet{http://mi.mathnet.ru/ppi1116}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=776762}
\zmath{https://zbmath.org/?q=an:0546.94017}
\transl
\jour Problems Inform. Transmission
\yr 1984
\vol 20
\issue 1
\pages 1--7
Linking options:
  • https://www.mathnet.ru/eng/ppi1116
  • https://www.mathnet.ru/eng/ppi/v20/i1/p3
  • 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:334
    Full-text PDF :185
    First page:2
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024