# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 48

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

Publication Year: 2010, Page(s): C2
| PDF (41 KB)
• ### Asynchronous CDMA Systems With Random Spreading—Part I: Fundamental Limits

Publication Year: 2010, Page(s):1477 - 1497
Cited by:  Papers (15)  |  Patents (3)
| | PDF (631 KB) | HTML

Spectral efficiency for asynchronous code division multiple access (CDMA) with random spreading is calculated in the large system limit allowing for arbitrary chip waveforms and frequency-flat fading. Signal-to-interference and noise ratios (SINRs) for suboptimal receivers, such as the linear minimum mean square error (MMSE) detectors, are derived. The approach is general and optionally allows eve... View full abstract»

• ### Asynchronous CDMA Systems With Random Spreading—Part II: Design Criteria

Publication Year: 2010, Page(s):1498 - 1520
Cited by:  Papers (7)
| | PDF (932 KB) | HTML

Totally asynchronous code-division multiple-access (CDMA) systems are addressed. In Part I, the fundamental limits of asynchronous CDMA systems are analyzed in terms of spectral efficiency and SINR at the output of the optimum linear detector. The focus of Part II is the design of low-complexity implementations of linear multiuser detectors in systems with many users that admit a multistage repres... View full abstract»

• ### Capacity-Achieving CPM Schemes

Publication Year: 2010, Page(s):1521 - 1541
Cited by:  Papers (20)
| | PDF (3319 KB) | HTML

The pragmatic approach to coded continuous-phase modulation (CPM) is proposed as a capacity-achieving low-complexity alternative to the serially concatenated CPM (SC-CPM) coding scheme. In this paper, we first perform a selection of the best spectrally efficient CPM modulations to be embedded into SC-CPM schemes. Then, we consider the pragmatic capacity (a.k.a. BICM capacity) of CPM modulations an... View full abstract»

• ### Asymptotic Statistics of the Mutual Information for Spatially Correlated Rician Fading MIMO Channels With Interference

Publication Year: 2010, Page(s):1542 - 1559
Cited by:  Papers (6)  |  Patents (3)
| | PDF (2068 KB) | HTML

The statistics of the mutual information of a separately correlated Rician fading multiple-input multiple-output (MIMO) channel in the presence of multiple-access interference are addressed in this paper. The approach followed is asymptotic in the number of transmit, receive, and interfering antennas, which are all assumed to grow asymptotically large while approaching finite ratios. In this asymp... View full abstract»

• ### Degrees of Freedom of a Communication Channel: Using DOF Singular Values

Publication Year: 2010, Page(s):1560 - 1573
Cited by:  Papers (3)
| | PDF (299 KB) | HTML

A fundamental problem in any communication system is: given a communication channel between a transmitter and a receiver, how many Â¿independentÂ¿ signals can be exchanged between them? Arbitrary communication channels that can be described by linear compact channel operators mapping between normed spaces are examined in this paper. The (well-known) notions of degrees of freedom (DOF) at level ... View full abstract»

• ### A Note on Interleaved Reed–Solomon Codes Over Galois Rings

Publication Year: 2010, Page(s):1574 - 1581
Cited by:  Papers (2)
| | PDF (269 KB) | HTML

Collaborative decoding of interleaved Reed-Solomon (RS) codes was first proposed by Krachkovsky in 1997. Their work has since sparked off a series of papers from various authors on the subject. In this paper, we study the merits of multisequence-shift-register-synthesis-based collaborative decoding of interleaved RS codes formed from RS codes over Galois rings, in terms of key performance measures... View full abstract»

• ### Codes for Asymmetric Limited-Magnitude Errors With Application to Multilevel Flash Memories

Publication Year: 2010, Page(s):1582 - 1595
Cited by:  Papers (62)  |  Patents (2)
| | PDF (517 KB) | HTML

Several physical effects that limit the reliability and performance of multilevel flash memories induce errors that have low magnitudes and are dominantly asymmetric. This paper studies block codes for asymmetric limited-magnitude errors over q-ary channels. We propose code constructions and bounds for such channels when the number of errors is bounded by t and the error magnitudes are boun... View full abstract»

• ### New Constant-Weight Codes From Propagation Rules

Publication Year: 2010, Page(s):1596 - 1599
| | PDF (157 KB) | HTML

This paper proposes some simple propagation rules which give rise to new binary constant-weight codes. View full abstract»

• ### On Trapping Sets and Guaranteed Error Correction Capability of LDPC Codes and GLDPC Codes

Publication Year: 2010, Page(s):1600 - 1611
Cited by:  Papers (22)
| | PDF (321 KB) | HTML

The relation between the girth and the guaranteed error correction capability of ?? -left-regular low-density parity-check (LDPC) codes when decoded using the bit flipping (serial and parallel) algorithms is investigated. A lower bound on the size of variable node sets which expand by a factor of at least 3 ??/4 is found based on the Moore bound. This bound, combined with the well kn... View full abstract»

• ### New Binary Singly Even Self-Dual Codes

Publication Year: 2010, Page(s):1612 - 1617
Cited by:  Papers (3)
| | PDF (201 KB) | HTML

In this paper, we construct new binary singly even self-dual codes with larger minimum weights than the previously known singly even self-dual codes for several lengths. Several known construction methods are used to construct the new self-dual codes. View full abstract»

• ### A Rate $R=5/20$ Hypergraph-Based Woven Convolutional Code With Free Distance $120$

Publication Year: 2010, Page(s):1618 - 1623
Cited by:  Papers (3)
| | PDF (280 KB) | HTML

A rate R=5/20 hypergraph-based woven convolutional code with overall constraint length 67 and constituent convolutional codes is presented. It is based on a 3-partite, 3-uniform, 4-regular hypergraph and contains rate Rc=3/4 constituent convolutional codes with overall constraint length 5. Although the code construction is based on low-complexity codes, the free distance of this constru... View full abstract»

• ### Improved Lower Bounds on Capacities of Symmetric 2D Constraints Using Rayleigh Quotients

Publication Year: 2010, Page(s):1624 - 1639
Cited by:  Papers (9)
| | PDF (716 KB) | HTML

A method for computing lower bounds on capacities of two-dimensional (2D) constraints having a symmetric presentation in either the horizontal or the vertical direction is presented. The method is a generalization of the method of Calkin and Wilf (SIAM J. Discrete Math., 1998). Previous best lower bounds on capacities of certain constraints are improved using the method. It is also shown ho... View full abstract»

• ### On the Hardness of Approximating Stopping and Trapping Sets

Publication Year: 2010, Page(s):1640 - 1650
Cited by:  Papers (27)
| | PDF (417 KB) | HTML

We prove that approximating the size of stopping and trapping sets in Tanner graphs of linear block codes, and more restrictively, the class of low-density parity-check (LDPC) codes, is NP-hard. The ramifications of our findings are that methods used for estimating the height of the error-floor of moderate- and long-length LDPC codes, based on stopping and trapping set enumeration, cannot provide ... View full abstract»

• ### Generalized and Doubly Generalized LDPC Codes With Random Component Codes for the Binary Erasure Channel

Publication Year: 2010, Page(s):1651 - 1672
Cited by:  Papers (26)
| | PDF (543 KB) | HTML

In this paper, a method for the asymptotic analysis of generalized low-density parity-check (GLDPC) codes and doubly generalized low-density parity-check (D-GLDPC) codes over the binary erasure channel (BEC), based on extrinsic information transfer (EXIT) chart, is described. This method overcomes the problem consisting of the impossibility to evaluate the EXIT function for the check or variable c... View full abstract»

• ### Knuth's Balanced Codes Revisited

Publication Year: 2010, Page(s):1673 - 1679
Cited by:  Papers (18)
| | PDF (372 KB) | HTML

In 1986, Don Knuth published a very simple algorithm for constructing sets of bipolar codewords with equal numbers of Â¿1Â¿s and Â¿-1Â¿s, called balanced codes. Knuth's algorithm is well suited for use with large codewords. The redundancy of Knuth's balanced codes is a factor of two larger than that of a code comprising the full set of balanced codewords. In this paper, we will present results of ... View full abstract»

• ### Some Results on Cyclic Codes Over ${F}_{2}+v{F}_{2}$

Publication Year: 2010, Page(s):1680 - 1684
Cited by:  Papers (31)
| | PDF (192 KB) | HTML

In this paper, we investigate the structure and properties of cyclic codes over the ring F 2+vF 2 . We first study the relationship between cyclic codes over F 2+vF 2 and binary cyclic codes. Then we prove that cyclic codes over the ring are principally generated, and give the generator polynomial of cyclic codes over the ring... View full abstract»

• ### Optimal Frequency-Hopping Sequences With New Parameters

Publication Year: 2010, Page(s):1685 - 1693
Cited by:  Papers (28)
| | PDF (264 KB) | HTML

A frequency-hopping sequence (FHS) of length v and frequency set size M is called a (v,M,Â¿)-FHS if its maximum out-of-phase Hamming autocorrelation is Â¿. Three new classes of optimal FHSs with respect to the Lempel-Greenberger bound are presented in this paper. First, new optimal (p,M,f)-FHSs are constructed when p = Mf +1 is an odd prime such that f is ... View full abstract»

• ### The Cross-Correlation of Binary Sequences With Optimal Autocorrelation

Publication Year: 2010, Page(s):1694 - 1701
Cited by:  Papers (5)
| | PDF (172 KB) | HTML

Binary sequences with low correlation have applications in communication systems and cryptography. Though binary sequences with optimal autocorrelation were constructed in the literature, no pair of binary sequences with optimal autocorrelation are known to have also best possible cross correlation. In this paper, new bounds on the cross correlation of binary sequences with optimal autocorrelation... View full abstract»

• ### New Sets of Zero or Low Correlation Zone Sequences via Interleaving Techniques

Publication Year: 2010, Page(s):1702 - 1713
Cited by:  Papers (16)
| | PDF (252 KB) | HTML

Sequence families with zero or low correlation zone can be used in the quasi-synchronous code-division multiple-access (QS-CDMA) communication systems. Interleaving techniques are very useful for sequence design. In this paper, we present a general construction of sequence families with zero or low correlation zone using interleaving techniques and complex Hadamard matrices. The component sequence... View full abstract»

• ### Autocorrelation of Legendre–Sidelnikov Sequences

Publication Year: 2010, Page(s):1714 - 1718
Cited by:  Papers (13)
| | PDF (144 KB) | HTML

We combine the concepts of the p-periodic Legendre sequence, the (q-1)-periodic Sidelnikov sequence and the two-prime generator to introduce a new p(q-1)-periodic sequence called Legendre-Sidelnikov sequence. We show that this new sequence is balanced if p=q. For an arbitrary odd prime p and an arbitrary power q of an odd prime with gcd (p... View full abstract»

• ### Strict Optimal Rational Approximants of Multisequences

Publication Year: 2010, Page(s):1719 - 1728
| | PDF (291 KB) | HTML

The synthesis problem of multisequences of elements of a field F is studied. A new way of approximation by rational functions to multisequences is introduced. Different from the usual approach by optimal rational approximant profile, in the proposed strict optimal rational approximant of a multisequence, the components of the optimal rational approximant are not required to have the same de... View full abstract»

• ### Optimal Sets of Frequency Hopping Sequences With Large Linear Spans

Publication Year: 2010, Page(s):1729 - 1736
Cited by:  Papers (9)
| | PDF (211 KB) | HTML

Frequency hopping (FH) is one of the basic spread coding technologies in spread spectrum communications. FH sequences are needed in FH code-division multiple access (CDMA) systems. For the anti-jamming purpose, FH sequences are required to have a large linear span. A few optimal sets of FH sequences are available in the literature. However, their sequences have very small linear spans. It is known... View full abstract»

• ### A Universal Scheme for Wyner–Ziv Coding of Discrete Sources

Publication Year: 2010, Page(s):1737 - 1750
Cited by:  Papers (6)  |  Patents (1)
| | PDF (748 KB) | HTML

We consider the Wyner-Ziv (WZ) problem of lossy compression where the decompressor observes a noisy version of the source, whose statistics are unknown. A new family of WZ coding algorithms is proposed and their universal optimality is proven. Compression consists of sliding-window processing followed by Lempel-Ziv (LZ) compression, while the decompressor is based on a modification of the discrete... 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