RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

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., 2014, Volume 50, Issue 2, Pages 20–30 (Mi ppi2137)  

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

Information Theory

On the capacity of a multiple-access vector adder channel

A. A. Frolov, V. V. Zyablov

Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia

Abstract: We investigate the capacity of the $Q$-frequency $S$-user vector adder channel (channel with intensity information) introduced by Chang and Wolf. Both coordinated and uncoordinated types of transmission are considered. Asymptotic (under the conditions $Q\to\infty$, $S=\gamma Q$, $0<\gamma<\infty$) upper and lower bounds on the relative (per subchannel) capacity are derived. The lower bound for the coordinated case is shown to increase with $\gamma$. At the same time, the relative capacity for the uncoordinated case is upper bounded by a constant.

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

English version:
Problems of Information Transmission, 2014, 50:2, 133–143

Bibliographic databases:

UDC: 621.391.1+519.72
Received: 25.09.2013
Revised: 27.02.2014

Citation: A. A. Frolov, V. V. Zyablov, “On the capacity of a multiple-access vector adder channel”, Probl. Peredachi Inf., 50:2 (2014), 20–30; Problems Inform. Transmission, 50:2 (2014), 133–143

Citation in format AMSBIB
\Bibitem{FroZya14}
\by A.~A.~Frolov, V.~V.~Zyablov
\paper On the capacity of a~multiple-access vector adder channel
\jour Probl. Peredachi Inf.
\yr 2014
\vol 50
\issue 2
\pages 20--30
\mathnet{http://mi.mathnet.ru/ppi2137}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3265794}
\elib{http://elibrary.ru/item.asp?id=23966811}
\transl
\jour Problems Inform. Transmission
\yr 2014
\vol 50
\issue 2
\pages 133--143
\crossref{https://doi.org/10.1134/S0032946014020021}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000339384800002}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84904424094}


Linking options:
  • http://mi.mathnet.ru/eng/ppi2137
  • http://mi.mathnet.ru/eng/ppi/v50/i2/p20

    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
    Remarks

    This publication is cited in the following articles:
    1. E. A. Bakin, G. S. Evseev, “Remark on “On the capacity of a multiple-access vector adder channel” by A. A. Frolov and V. V. Zyablov”, Problems Inform. Transmission, 52:1 (2016), 1–5  mathnet  crossref  mathscinet  isi  elib  elib
    2. I. M. M. de Souza, M. L. M. G. Alcoforado, V. C. da Rocha Jr., “Turbo decoding of simple product codes in a two user binary adder channel employing the BahlCockeJelinekRaviv algorithm”, Telecommun. Syst., 68:3 (2018), 513–521  crossref  isi  scopus
  •   Problems of Information Transmission
    Number of views:
    This page:270
    Full text:70
    References:46
    First page:17

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