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, 1985, Volume 21, Issue 1, Pages 105–109 (Mi ppi977)  
Сorrespondence

Codes for a Two-User Adder Channel

G. G. Khachatryan
Full-text PDF (582 kB)
Abstract: We give a method for constructing $\delta$-decodable pairs of codes for a binary two-user adder channel. We present examples of codes with prescribed $\delta$ with rates beyond the time-sharing bound.
Received: 11.01.1983
Revised: 11.04.1983
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
Citation: G. G. Khachatryan, “Codes for a Two-User Adder Channel”, Probl. Peredachi Inf., 21:1 (1985), 105–109
Citation in format AMSBIB
\Bibitem{Kha85}
\by G.~G.~Khachatryan
\paper Codes for a~Two-User Adder Channel
\jour Probl. Peredachi Inf.
\yr 1985
\vol 21
\issue 1
\pages 105--109
\mathnet{http://mi.mathnet.ru/ppi977}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=791539}
\zmath{https://zbmath.org/?q=an:0589.94003}
Linking options:
  • https://www.mathnet.ru/eng/ppi977
  • https://www.mathnet.ru/eng/ppi/v21/i1/p105
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024