709,635 research outputs found
Multiaccess Channels with State Known to One Encoder: Another Case of Degraded Message Sets
We consider a two-user state-dependent multiaccess channel in which only one
of the encoders is informed, non-causally, of the channel states. Two
independent messages are transmitted: a common message transmitted by both the
informed and uninformed encoders, and an individual message transmitted by only
the uninformed encoder. We derive inner and outer bounds on the capacity region
of this model in the discrete memoryless case as well as the Gaussian case.
Further, we show that the bounds for the Gaussian case are tight in some
special cases.Comment: 5 pages, Proc. of IEEE International Symposium on Information theory,
ISIT 2009, Seoul, Kore
Bounds on the Capacity of the Relay Channel with Noncausal State Information at Source
We consider a three-terminal state-dependent relay channel with the channel
state available non-causally at only the source. Such a model may be of
interest for node cooperation in the framework of cognition, i.e.,
collaborative signal transmission involving cognitive and non-cognitive radios.
We study the capacity of this communication model. One principal problem in
this setup is caused by the relay's not knowing the channel state. In the
discrete memoryless (DM) case, we establish lower bounds on channel capacity.
For the Gaussian case, we derive lower and upper bounds on the channel
capacity. The upper bound is strictly better than the cut-set upper bound. We
show that one of the developed lower bounds comes close to the upper bound,
asymptotically, for certain ranges of rates.Comment: 5 pages, submitted to 2010 IEEE International Symposium on
Information Theor
Grassl–Rötteler cyclic and consta-cyclic MDS codes are generalised Reed–Solomon codes
We prove that the cyclic and constacyclic codes constructed by Grassl and Rötteler in International Symposium on Information Theory (ISIT), pp. 1104–1108 (2015) are generalised Reed–Solomon codes. This note can be considered as an addendum to Grassl and Rötteler International Symposium on Information Theory (ISIT), pp 1104–1108 (2015). It can also be considered as an appendix to Ball and Vilar IEEE Trans Inform Theory 68:3796–3805, (2022) where Conjecture 11 of International Symposium on Information Theory (ISIT), pp 1104–1108 (2015), which was stated for Grassl–Rötteler codes, is proven for generalised Reed–Solomon codes. The content of this note, together with IEEE Trans Inform Theory 68:3796–3805, (2022) therefore implies that Conjecture 11 from International Symposium on Information Theory (ISIT), pp. 1104–1108 (2015) is true.Peer ReviewedPostprint (author's final draft
A Factor-Graph Representation of Probabilities in Quantum Mechanics
A factor-graph representation of quantum-mechanical probabilities is
proposed. Unlike standard statistical models, the proposed representation uses
auxiliary variables (state variables) that are not random variables.Comment: Proc. IEEE International Symposium on Information Theory (ISIT),
Cambridge, MA, July 1-6, 201
Families of unitary matrices achieving full diversity
This paper presents an algebraic construction of families of unitary matrices
that achieve full diversity. They are obtained as subsets of cyclic division
algebras.Comment: To appear in the proceedings of the 2005 IEEE International Symposium
on Information Theory, Adelaide, Australia, September 4-9, 200
New Codes and Inner Bounds for Exact Repair in Distributed Storage Systems
We study the exact-repair tradeoff between storage and repair bandwidth in
distributed storage systems (DSS). We give new inner bounds for the tradeoff
region and provide code constructions that achieve these bounds.Comment: Submitted to the IEEE International Symposium on Information Theory
(ISIT) 2014. This draft contains 8 pages and 4 figure
Source Polarization
The notion of source polarization is introduced and investigated. This
complements the earlier work on channel polarization. An application to
Slepian-Wolf coding is also considered. The paper is restricted to the case of
binary alphabets. Extension of results to non-binary alphabets is discussed
briefly.Comment: To be presented at the IEEE 2010 International Symposium on
Information Theory
Equality in the Matrix Entropy-Power Inequality and Blind Separation of Real and Complex sources
The matrix version of the entropy-power inequality for real or complex
coefficients and variables is proved using a transportation argument that
easily settles the equality case. An application to blind source extraction is
given.Comment: 5 pages, in Proc. 2019 IEEE International Symposium on Information
Theory (ISIT 2019), Paris, France, July 7-12, 201
Information Sets of Multiplicity Codes
We here provide a method for systematic encoding of the Multiplicity codes
introduced by Kopparty, Saraf and Yekhanin in 2011. The construction is built
on an idea of Kop-party. We properly define information sets for these codes
and give detailed proofs of the validity of Kopparty's construction, that use
generating functions. We also give a complexity estimate of the associated
encoding algorithm.Comment: International Symposium on Information Theory, Jun 2015, Hong-Kong,
China. IEE
- …