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, 1994, Volume 30, Issue 3, Pages 23–28 (Mi ppi241)  
This article is cited in 3 scientific papers (total in 3 papers)

Coding Theory

Some New NP-Complete Coding Problems

S. Barg
Full-text PDF (747 kB) Citations (3)
Abstract: We prove the NP-completeness of the basic decision problems for ternary linear codes. In particular, we prove that finding out whether a ternary linear code contains a vector of weight equal to the code length is NP-complete. In addition, we prove the hardness of minimum distance decoding for linear product codes with nontrivial factors.
Received: 16.08.1993
Revised: 18.01.1994
Bibliographic databases:
Document Type: Article
UDC: 621.391.1:519.712
Language: Russian
Citation: S. Barg, “Some New NP-Complete Coding Problems”, Probl. Peredachi Inf., 30:3 (1994), 23–28; Problems Inform. Transmission, 30:3 (1994), 209–214
Citation in format AMSBIB
\Bibitem{Bar94}
\by S.~Barg
\paper Some New NP-Complete Coding Problems
\jour Probl. Peredachi Inf.
\yr 1994
\vol 30
\issue 3
\pages 23--28
\mathnet{http://mi.mathnet.ru/ppi241}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1299687}
\zmath{https://zbmath.org/?q=an:0913.94009}
\transl
\jour Problems Inform. Transmission
\yr 1994
\vol 30
\issue 3
\pages 209--214
Linking options:
  • https://www.mathnet.ru/eng/ppi241
  • https://www.mathnet.ru/eng/ppi/v30/i3/p23
    • This publication is cited in the following 3 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:1253
    Full-text PDF :617
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024