By Topic

# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 47

Publication Year: 2014, Page(s):C1 - C4
| PDF (175 KB)
• ### IEEE Transactions on Information Theory publication information

Publication Year: 2014, Page(s): C2
| PDF (142 KB)
• ### A Universal Grammar-Based Code for Lossless Compression of Binary Trees

Publication Year: 2014, Page(s):1373 - 1386
Cited by:  Papers (3)
| | PDF (425 KB) | HTML

We consider the problem of lossless compression of binary trees, with the aim of reducing the number of code bits needed to store or transmit such trees. A lossless grammar-based code is presented, which encodes each binary tree into a binary codeword in two steps. In the first step, the tree is transformed into a context-free grammar from which the tree can be reconstructed. In the second step, t... View full abstract»

• ### Universal Enumerative Coding for Tree Models

Publication Year: 2014, Page(s):1387 - 1411
Cited by:  Papers (1)
| | PDF (1160 KB) | HTML

Efficient enumerative coding for tree sources is, in general, surprisingly intricate-a simple uniform encoding of type classes, which is asymptotically optimal in expectation for many classical models, such as FSMs, turns out not to be so in this case. We describe an efficiently computable enumerative code that is universal in the family of tree models in the sense that, for a string emitted by an... View full abstract»

• ### Huffman Redundancy for Large Alphabet Sources

Publication Year: 2014, Page(s):1412 - 1427
Cited by:  Papers (4)
| | PDF (573 KB) | HTML

The performance of optimal prefix-free encoding for memoryless sources with a large alphabet size is studied. It is shown that the redundancy of the Huffman code for almost all sources with a large alphabet size n is very close to that of the average distribution of the monotone sources with n symbols. This value lies between 0.02873 and 0.02877 bit for sufficiently large n. View full abstract»

• ### On the Information Theoretic Performance Comparison of Causal Video Coding and Predictive Video Coding

Publication Year: 2014, Page(s):1428 - 1446
| | PDF (557 KB) | HTML

Causal video coding is a coding paradigm where video source frames X1, X2,..., XN are encoded in a frame-by-frame manner, the encoder for each frame can use all previous source frames and all previous encoded frames, and the corresponding decoder can use only all previous encoded frames. In the special case where the encoder for each frame Xk is further ... View full abstract»

• ### Lossless Coding for Distributed Streaming Sources

Publication Year: 2014, Page(s):1447 - 1474
Cited by:  Papers (6)
| | PDF (1032 KB) | HTML

Distributed source coding is traditionally viewed in a block coding context wherein all source symbols are known in advance by the encoders. However, many modern applications to which distributed source coding ideas are applied, are better modeled as having streaming data. In a streaming setting, source symbol pairs are revealed to separate encoders in real time and need to be reconstructed at the... View full abstract»

• ### Some Bounds on the Size of Codes

Publication Year: 2014, Page(s):1475 - 1480
Cited by:  Papers (1)
| | PDF (398 KB) | HTML

We present some upper bounds on the size of nonlinear codes and their restriction to systematic codes and linear codes. These bounds are independent of other known theoretical bounds, e.g., the Griesmer bound, the Johnson bound, the Plotkin bound, and of linear programming bounds. One of the new bound is actually an improvement of a bound by Zinoviev, Litsyn, and Laihonen. Our experiments show tha... View full abstract»

• ### Capacity-Achieving Multiwrite WOM Codes

Publication Year: 2014, Page(s):1481 - 1487
Cited by:  Papers (14)
| | PDF (209 KB) | HTML

In this paper, we give an explicit construction of a family of capacity-achieving binary t-write WOM codes for any number of writes t, which have polynomial time encoding and decoding algorithms. The block length of our construction is N=(t/ε)O(t/(δε)) when ε is the gap to capacity and encoding and decoding run in time N1+δ. This is the firs... View full abstract»

• ### Stopping Sets of Algebraic Geometry Codes

Publication Year: 2014, Page(s):1488 - 1495
Cited by:  Papers (2)
| | PDF (218 KB) | HTML

Stopping sets and stopping set distribution of a linear code play an important role in the performance analysis of iterative decoding for this linear code. Let C be an [n, k] linear code over Fq with parity-check matrix H, where the rows of H may be dependent. Let [n] = {1, 2,...,n} denote the set of column indices of H. A stopping set S of C with parity-check matrix H is a subset of [n... View full abstract»

• ### Hermitian Self-Dual Abelian Codes

Publication Year: 2014, Page(s):1496 - 1507
Cited by:  Papers (3)
| | PDF (691 KB) | HTML

Hermitian self-dual abelian codes in a group ring Fq2[G], where Fq2 is a finite field of order q2 and G is a finite abelian group, are studied. Using the well-known discrete Fourier transform decomposition for a semisimple group ring, a characterization of Hermitian self-dual abelian codes in Fq2[G] is given, together wit... View full abstract»

• ### $BBZ_{2}BBZ_{4}$ -Additive Cyclic Codes

Publication Year: 2014, Page(s):1508 - 1514
Cited by:  Papers (8)
| | PDF (659 KB) | HTML

In this paper, we study Z2Z4-additive cyclic codes. These codes are identified as Z4[x]-submodules of the ring Rr,s=Z2[x]/〈xr-1〉×Z4[x]/〈xs-1〉. The algebraic structure of this family of codes is studied and a set of generator polynomials for this family as a Z4[x]-su... View full abstract»

• ### Optimal Index Codes With Near-Extreme Rates

Publication Year: 2014, Page(s):1515 - 1527
Cited by:  Papers (5)
| | PDF (704 KB) | HTML

The min-rank of a digraph was shown to represent the length of an optimal scalar linear solution of the corresponding instance of the Index Coding with Side Information (ICSI) problem. In this paper, the graphs and digraphs of near-extreme min-ranks are studied. Those graphs and digraphs correspond to the ICSI instances having near-extreme transmission rates when using optimal scalar linear index ... View full abstract»

• ### On the Construction of Nonbinary Quantum BCH Codes

Publication Year: 2014, Page(s):1528 - 1535
Cited by:  Papers (11)
| | PDF (631 KB) | HTML

Four quantum code constructions generating several new families of good nonbinary quantum nonprimitive nonnarrow-sense, Bose-Chaudhuri-Hocquenghem codes, are presented in this paper. The first two are based on Calderbank-Shor-Steane (CSS) construction derived from two nonprimitive Bose-Chaudhuri-Hocquenghem codes. The third one is based on Steane's enlargement of nonbinary CSS codes applied to sui... View full abstract»

• ### The Entropy Power Inequality for Quantum Systems

Publication Year: 2014, Page(s):1536 - 1548
Cited by:  Papers (13)
| | PDF (293 KB) | HTML

When two independent analog signals, X and Y are added together giving Z=X+Y, the entropy of Z, H(Z), is not a simple function of the entropies H(X) and H(Y), but rather depends on the details of X and Y's distributions. Nevertheless, the entropy power inequality (EPI), which states that e2H(Z) ≥ e2H(X)+e2H(Y), gives a very tight restriction on the entropy o... View full abstract»

• ### When Do Local Operations and Classical Communication Suffice for Two-Qubit State Discrimination?

Publication Year: 2014, Page(s):1549 - 1561
Cited by:  Papers (7)
| | PDF (288 KB) | HTML

In this paper, we consider the conditions under which a given ensemble of two-qubit states can be optimally distinguished by local operations and classical communication (LOCC). We begin by completing the perfect distinguishability problem of two-qubit ensembles-both for separable operations and LOCC-by providing necessary and sufficient conditions for the perfect discrimination of one pure and on... View full abstract»

• ### A Decoupling Approach to Classical Data Transmission Over Quantum Channels

Publication Year: 2014, Page(s):1562 - 1572
Cited by:  Papers (6)
| | PDF (352 KB) | HTML

Most coding theorems in quantum Shannon theory can be proven using the decoupling technique. To send data through a channel, one guarantees that the environment gets no information about it. Uhlmann's theorem then ensures that the receiver must be able to decode. While a wide range of problems can be solved this way, one of the most basic coding problems remains impervious to a direct application ... View full abstract»

• ### Smooth Max-Information as One-Shot Generalization for Mutual Information

Publication Year: 2014, Page(s):1573 - 1581
Cited by:  Papers (5)
| | PDF (230 KB) | HTML

We study formal properties of smooth max-information, a generalization of von Neumann mutual information derived from the max-relative entropy. Recent work suggests that it is a useful quantity in one-shot channel coding, quantum rate distortion theory, and the physics of quantum many-body systems. Max-information can be defined in multiple ways. We demonstrate that different smoothed definitions ... View full abstract»

• ### Extremal Channels of Gallager's $E_{0}$ Under the Basic Polarization Transformations

Publication Year: 2014, Page(s):1582 - 1591
Cited by:  Papers (6)
| | PDF (288 KB) | HTML

We study the extremality of the binary erasure channel and the binary symmetric channel for Gallager's reliability function E0 of binary input discrete memoryless channels evaluated under the uniform input distribution from the aspect of channel polarization. In particular, we show that amongst all binary discrete memoryless channels of a given E0(ρ) value, for a fixed... View full abstract»

• ### Refinement of the Sphere-Packing Bound: Asymmetric Channels

Publication Year: 2014, Page(s):1592 - 1614
Cited by:  Papers (5)
| | PDF (619 KB) | HTML

We provide a refinement of the sphere-packing bound for constant composition codes over asymmetric discrete memoryless channels that improves the subexponential factor in front of the exponent. The order of our subexponential factor is Ω(N-0.5(1+ε+ρR*)) for any ϵ > 0, where ρR* is the left derivative of the sphere-pa... View full abstract»

• ### Capacity of Gaussian Channels With Duty Cycle and Power Constraints

Publication Year: 2014, Page(s):1615 - 1629
Cited by:  Papers (5)
| | PDF (767 KB) | HTML

In many wireless communication systems, radios are subject to a duty cycle constraint, that is, a radio can only actively transmit signals over a fraction of the time. For example, it is desirable to have a small duty cycle in some low power systems; a half-duplex radio cannot keep transmitting if it wishes to receive useful signals; and a cognitive radio needs to listen and detect primary users f... View full abstract»

• ### On Extracting Common Random Bits From Correlated Sources on Large Alphabets

Publication Year: 2014, Page(s):1630 - 1637
| | PDF (239 KB) | HTML

Suppose Alice and Bob receive strings X=(X1,...,Xn) and Y=(Y1,...,Yn) each uniformly random in [s]n, but so that X and Y are correlated. For each symbol i, we have that Yi=Xi with probability 1-ε and otherwise Yi is chosen independently and uniformly from [s]. Alice and Bob wish to use their respective s... View full abstract»

• ### Constructions of Resilient S-Boxes With Strictly Almost Optimal Nonlinearity Through Disjoint Linear Codes

Publication Year: 2014, Page(s):1638 - 1651
Cited by:  Papers (9)
| | PDF (2059 KB) | HTML

In this paper, a novel approach of finding disjoint linear codes is presented. The cardinality of a set of [u, m, t+1] disjoint linear codes largely exceeds all the previous best known methods used for the same purpose. Using such sets of disjoint linear codes, not necessarily of the same length, we have been able to provide a construction technique of t-resilient S-boxes F:F2n→2... View full abstract»

• ### Natural Generalizations of Threshold Secret Sharing

Publication Year: 2014, Page(s):1652 - 1664
Cited by:  Papers (3)
| | PDF (331 KB) | HTML

We present new families of access structures that, similarly to the multilevel and compartmented access structures introduced in previous works, are natural generalizations of threshold secret sharing. Namely, they admit ideal linear secret sharing schemes over every large enough finite field, they can be described by a small number of parameters, and they have useful properties for the applicatio... View full abstract»

• ### Necessary Conditions for the Existence of Regular $p$-Ary Bent Functions

Publication Year: 2014, Page(s):1665 - 1672
Cited by:  Papers (4)
| | PDF (286 KB) | HTML

We find some necessary conditions for the existence of regular p-ary bent functions (from Znp to Zp), where p is a prime. In more detail, we show that there is no regular p-ary bent function f in n variables with w(Mf) larger than n/2, and for a given nonnegative integer k, there is no regular p-ary bent function f in n variables with w(Mf)=n/2-k ( n+3/2-k, respect... View full abstract»

## Aims & Scope

IEEE Transactions on Information Theory publishes papers concerned with the transmission, processing, and utilization of information.

Full Aims & Scope

## Meet Our Editors

Editor-in-Chief
Prakash Narayan

Department of Electrical and Computer Engineering