# IEEE Transactions on Information Theory

## Volume 63 Issue 10 • Oct. 2017

The purchase and pricing options for this item are unavailable. Select items are only available as part of a subscription package. You may try again later or contact us for more information.

## Filter Results

Displaying Results 1 - 25 of 51

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

Publication Year: 2017, Page(s): C2
| PDF (163 KB)
• ### Capacity and Expressiveness of Genomic Tandem Duplication

Publication Year: 2017, Page(s):6129 - 6138
| | PDF (712 KB) | HTML

The majority of the human genome consists of repeated sequences. An important type of repeated sequences common in the human genome are tandem repeats, where identical copies appear next to each other. For example, in the sequence AGTCTGTGC, TGTG is a tandem repeat, that may be generated from AGTCTGC by a tandem duplication of length 2. In this paper, we investigate the possibility of generating a... View full abstract»

• ### Generalized Plateaued Functions and Admissible (Plateaued) Functions

Publication Year: 2017, Page(s):6139 - 6148
| | PDF (215 KB) | HTML

Plateaued functions are very important cryptographic functions due to their various desirable cryptographic characteristics. We point out that plateaued functions are more general than bent functions (that is, functions with maximum nonlinearity). Some Boolean plateaued functions have large nonlinearity, which provides protection against fast correlation attacks when they are used as combiners or ... View full abstract»

• ### Generic Construction of Bent Functions and Bent Idempotents With Any Possible Algebraic Degrees

Publication Year: 2017, Page(s):6149 - 6157
| | PDF (207 KB) | HTML

As a class of optimal combinatorial objects, bent functions have important applications in cryptography, sequence design, and coding theory. Bent idempotents are a subclass of bent functions and of great interest, since they can be stored in less space and allow faster computation of the Walsh-Hadamard transform. The objective of this paper is to present a generic construction of bent functions fr... View full abstract»

• ### Low Correlation Sequences From Linear Combinations of Characters

Publication Year: 2017, Page(s):6158 - 6178
| | PDF (662 KB) | HTML

Pairs of binary sequences formed using linear combinations of multiplicative characters of finite fields are exhibited that, when compared with a random sequence pairs, simultaneously achieve significantly lower mean square autocorrelation values (for each sequence in the pair) and significantly lower mean square crosscorrelation values. If we define crosscorrelation merit factor analogously to th... View full abstract»

• ### New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters

Publication Year: 2017, Page(s):6179 - 6187
| | PDF (576 KB) | HTML

In practical applications, such as direct spread code division multiple access communications, space-time codes and compressed sensing, and codebooks with small inner-product correlation are required. It is extremely difficult to construct codebooks achieving the Levenshtein bound. In this paper, two new constructions of infinitely many codebooks with multiplicative characters of finite fields are... View full abstract»

• ### Investigations on Periodic Sequences With Maximum Nonlinear Complexity

Publication Year: 2017, Page(s):6188 - 6198
| | PDF (615 KB) | HTML

The nonlinear complexity of a periodic sequence s is the length of the shortest feedback shift register that can generate s, and its value is upper bounded by the least period of s minus 1. In this paper, a recursive approach that generates all periodic sequences with maximum nonlinear complexity is presented, and the total number of such sequences is determined. The randomness properties of these... View full abstract»

• ### Spatially Coupled Turbo-Like Codes

Publication Year: 2017, Page(s):6199 - 6215
| | PDF (1631 KB) | HTML

In this paper, we introduce the concept of spatially coupled turbo-like codes (SC-TCs) as the spatial coupling of a number of turbo-like code ensembles. In particular, we consider the spatial coupling of parallel concatenated codes, introduced by Berrou et al., and that of serially concatenated codes (SCCs), introduced by Benedetto et al. Furthermore, we propose two extensions of braided convoluti... View full abstract»

• ### A Sugiyama-Like Decoding Algorithm for Convolutional Codes

Publication Year: 2017, Page(s):6216 - 6226
| | PDF (253 KB) | HTML

We propose a decoding algorithm for a class of convolutional codes called skew Reed-Solomon convolutional codes. These are convolutional codes of designed Hamming distance endowed with a cyclic structure yielding a left ideal of a non-commutative ring (a quotient of a skew polynomial ring). In this setting, right and left division algorithms exist, so our algorithm follows the guidelines of the Su... View full abstract»

• ### Improved Lower Bounds on the Size of Balls Over Permutations With the Infinity Metric

Publication Year: 2017, Page(s):6227 - 6239
Cited by:  Papers (1)
| | PDF (504 KB) | HTML

We study the size (or volume) of balls in the metric space of permutations, Sn, under the infinity metric. We focus on the regime of balls with radius r = p · (n-1), p ∈ [0, 1], i.e., a radius that is a constant fraction of the maximum possible distance. We provide new lower bounds on the size of such balls. These new lower bounds reduce the asymptotic gap to the known upp... View full abstract»

• ### Two New Families of Two-Weight Codes

Publication Year: 2017, Page(s):6240 - 6246
| | PDF (354 KB) | HTML

We construct two new infinite families of trace codes of dimension 2m, over the ring Fp + uFp, with u2 = u, when p is an odd prime. They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by using Gauss sums. By Gray mapping, we obtain two infinite families of linear p-ary codes of respective lengths (pm-1)2 View full abstract»

• ### Some Repeated-Root Constacyclic Codes Over Galois Rings

Publication Year: 2017, Page(s):6247 - 6255
| | PDF (217 KB) | HTML

Codes over Galois rings have been studied extensively during the last three decades. Negacyclic codes over GR(2a, m) of length 2s have been characterized: the ring R2(a, m, -1) = GR(2a, m)[x]/(x2s t 1) is a chain ring. Furthermore, these results have been generalized to λ-constacyclic codes for any unit λ of the form 4z - 1, z &#... View full abstract»

• ### Coding for Interactive Communication Correcting Insertions and Deletions

Publication Year: 2017, Page(s):6256 - 6270
| | PDF (534 KB) | HTML

We consider the question of interactive communication, in which two remote parties perform a computation, while their communication channel is (adversarially) noisy. We extend here the discussion into a more general and stronger class of noise, namely, we allow the channel to perform insertions and deletions of symbols. These types of errors may bring the parties “out of sync,” so th... View full abstract»

• ### UEP Constructions of Quasi-Cyclic Low-Density Parity-Check Codes via Masking

Publication Year: 2017, Page(s):6271 - 6294
| | PDF (1568 KB) | HTML

In this paper, the algebraic constructions of quasi-cyclic low-density parity-check (QC-LDPC) codes with the unequal error protection (UEP) property are considered. A criterion for constructing such codes via the masking technique is proposed, based on which explicit conditions on the base parity-check matrices and masking matrices to achieve UEP are provided. We also give three specific construct... View full abstract»

• ### Majority Logic Decoding Under Data-Dependent Logic Gate Failures

Publication Year: 2017, Page(s):6295 - 6306
| | PDF (511 KB) | HTML

A majority logic decoder made of unreliable logic gates, whose failures are transient and data-dependent, is analyzed. Based on a combinatorial representation of fault configurations a closed-form expression for the average bit error rate for a one-step majority logic decoder is derived, for a regular low-density parity-check (LDPC) code ensemble and the proposed failure model. The presented analy... View full abstract»

• ### Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization

Publication Year: 2017, Page(s):6307 - 6317
Cited by:  Papers (1)
| | PDF (549 KB) | HTML

An (n, k, l) maximum distance separable (MDS) array code of length n, dimension k = n - r, and subpacketization l is formed of l × n matrices over a finite field F, with every column of the matrix stored on a separate node in the distributed storage system and viewed as a coordinate of the codeword. Repair of a failed node (recovery of one erased column) can be performed by accessing a set ... View full abstract»

• ### Minimum Storage Regenerating Codes for All Parameters

Publication Year: 2017, Page(s):6318 - 6328
| | PDF (590 KB) | HTML

Regenerating codes for distributed storage have attracted much research interest in the past decade. Such codes trade the bandwidth needed to repair a failed node with the overall amount of data stored in the network. Minimum storage regenerating (MSR) codes are an important class of optimal regenerating codes that minimize (first) the amount of data stored per node and (then) the repair bandwidth... View full abstract»

• ### Distributed Simulation of Continuous Random Variables

Publication Year: 2017, Page(s):6329 - 6343
| | PDF (920 KB) | HTML

We establish the first known upper bound on the exact and Wyner's common information of n continuous random variables in terms of the dual total correlation between them (which is a generalization of mutual information). In particular, we show that when the pdf of the random variables is log-concave, there is a constant gap of n2 loge + 9n log n between this upper bound and the dual total correlat... View full abstract»

• ### Hamilton Paths With Lasting Separation

Publication Year: 2017, Page(s):6344 - 6346
| | PDF (122 KB) | HTML

We determine the asymptotics of the largest cardinality of a set of Hamilton paths in the complete graph with vertex set [n] under the condition that for any two of the paths in the family there is a subpath of length k entirely contained in only one of them and edge-disjoint from the other one. View full abstract»

• ### Coding for the Large-Alphabet Adversarial Channel

Publication Year: 2017, Page(s):6347 - 6363
| | PDF (429 KB) | HTML

We consider the problem of encoding an i.i.d. source into a set of symbols or messages that may be altered by an adversary while en route to the decoder. We focus in particular on the regime in which the number of messages is fixed while the blocklength of the source and the size of each message tend to infinity. For this fixed-blocklength, “large alphabet” channel, we show that comb... View full abstract»

• ### Channel Detection in Coded Communication

Publication Year: 2017, Page(s):6364 - 6392
| | PDF (582 KB) | HTML

The problem of block-coded communication where in each block the channel law belongs to one of two disjoint sets is considered. The decoder is aimed to decode only messages that have undergone a channel from one of the sets, and thus has to detect the set which contains the underlying channel. The simplified case where each of the sets is a singleton is studied first. The decoding error, false ala... View full abstract»

• ### An Achievable Rate Region Based on Coset Codes for Multiple Access Channel With States

Publication Year: 2017, Page(s):6393 - 6415
| | PDF (1060 KB) | HTML

We prove that the ensemble of the nested coset codes built on finite fields achieves the capacity of arbitrary discrete memoryless point-to-point channels. Exploiting its algebraic structure, we develop a coding technique for communication over general discrete multiple access channel with channel state information distributed noncausally at the transmitters. We build an algebraic coding framework... View full abstract»

• ### Capacity Bounds for the $K$ -User Gaussian Interference Channel

Publication Year: 2017, Page(s):6416 - 6439
Cited by:  Papers (1)
| | PDF (1990 KB) | HTML

The capacity region of the K-user Gaussian interference channel (GIC) is a long-standing open problem and even capacity outer bounds are little known in general. A significant progress on degrees-of-freedom (DoF) analysis, a first-order capacity approximation, for the K-user GIC has provided new important insights into the problem of interest in the high signal-to-noise ratio (SNR) limit. However,... View full abstract»

• ### Models and Information Rates for Multiuser Optical Fiber Channels With Nonlinearity and Dispersion

Publication Year: 2017, Page(s):6440 - 6456
| | PDF (1067 KB) | HTML

Two discrete-time interference channel models are developed for information transmission over a single span of optical fiber using wavelength-division multiplexing (WDM) and lumped amplification. The models are derived from the nonlinear Schrödinger equation by including the nonlinear phenomena of self-phase modulation (SPM) and cross-phase modulation (XPM), but ignoring four-wave mixing, ... 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