IEEE Transactions on Information Theory

Issue 5 • May 2006

Filter Results

Displaying Results 1 - 25 of 47
  • Table of contents

    Publication Year: 2006, Page(s):c1 - c4
    Request permission for commercial reuse | PDF file iconPDF (46 KB)
    Freely Available from IEEE
  • IEEE Transactions on Information Theory publication information

    Publication Year: 2006, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (37 KB)
    Freely Available from IEEE
  • Achievable rates in cognitive radio channels

    Publication Year: 2006, Page(s):1813 - 1827
    Cited by:  Papers (670)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB) | HTML iconHTML

    Cognitive radio promises a low-cost, highly flexible alternative to the classic single-frequency band, single-protocol wireless device. By sensing and adapting to its environment, such a device is able to fill voids in the wireless spectrum and can dramatically increase spectral efficiency. In this paper, the cognitive radio channel is defined as a two-sender, two-receiver interference channel in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Opportunistic orthogonal writing on dirty paper

    Publication Year: 2006, Page(s):1828 - 1846
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (519 KB) | HTML iconHTML

    A simple scheme that achieves the capacity and the reliability function of the wideband Costa dirty-paper channel is proposed. The scheme can be interpreted as an opportunistic version of pulse position modulation (PPM). This interpretation suggests a natural generalization of the scheme which we show to achieve the capacity per unit cost of Gel'fand-Pinsker channels with a zero-cost input letter. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive transmission with finite code rates

    Publication Year: 2006, Page(s):1847 - 1860
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB) | HTML iconHTML

    This work examines a transmission system which adapts a finite set of code rates and a continuously varying transmit power. We propose a technique for finding the average reliable throughput (ART)-maximizing policy satisfying an average power constraint for a slow fading additive white Gaussian noise (AWGN) channel. ART is a measure motivated by the information outage and can, for example, be argu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A separation theorem for single-source network coding

    Publication Year: 2006, Page(s):1861 - 1871
    Cited by:  Papers (30)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (330 KB) | HTML iconHTML

    In this paper, we consider a point-to-point communication network of discrete memoryless channels. In the network, there are a source node and possibly more than one sink node. Information is generated at the source node and is multicast to each sink node. We allow a node to encode its received information before loading it onto an outgoing channel, where the channels are independent of each other... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Superposition coding for side-information channels

    Publication Year: 2006, Page(s):1872 - 1889
    Cited by:  Papers (65)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB) | HTML iconHTML

    We present simple, practical codes designed for the binary and Gaussian dirty-paper channels. We show that the dirty-paper decoding problem can be transformed into an equivalent multiple-access decoding problem, for which we apply superposition coding. Our concept is a generalization of the nested lattices approach of Zamir, Shamai, and Erez. In a theoretical setting, our constructions are capable... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An information-lossless decomposition theory of relational information systems

    Publication Year: 2006, Page(s):1890 - 1903
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (462 KB) | HTML iconHTML

    Relational information systems, systems that can be represented by tables of finite states, are commonly used in many areas such as logic circuits, finite-state machines, and relational databases. Decomposition is a natural method of handling complex systems and removing redundancies. It splits a table into a network of smaller, simpler, and interrelated new tables. In order to preserve the origin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • General formulas for fixed-length quantum entanglement concentration

    Publication Year: 2006, Page(s):1904 - 1921
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (457 KB) | HTML iconHTML

    In this paper, we derive general formulas for the amount of entanglement that can be concentrated from general sequences of partially entangled, bipartite pure states. The formulas are obtained by using an information-spectrum approach. The formulas obtained express the optimal rate under constant error constraints or exponential error constraints in the asymptotic framework. Since the formulas tr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mismatched codebooks and the role of entropy coding in lossy data compression

    Publication Year: 2006, Page(s):1922 - 1938
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB) | HTML iconHTML

    We introduce a universal quantization scheme based on random coding, and we analyze its performance. This scheme consists of a source-independent random codebook (typically mismatched to the source distribution), followed by optimal entropy coding that is matched to the quantized codeword distribution. A single-letter formula is derived for the rate achieved by this scheme at a given distortion, i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the MDL principle for i.i.d. sources with large alphabets

    Publication Year: 2006, Page(s):1939 - 1955
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (413 KB) | HTML iconHTML

    Average case universal compression of independent and identically distributed (i.i.d.) sources is investigated, where the source alphabet is large, and may be sublinear in size or even larger than the compressed data sequence length n. In particular, the well-known results, including Rissanen's strongest sense lower bound, for fixed-size alphabets are extended to the case where the alphabet size k... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • n-channel entropy-constrained multiple-description lattice vector quantization

    Publication Year: 2006, Page(s):1956 - 1973
    Cited by:  Papers (35)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB) | HTML iconHTML

    In this paper, we derive analytical expressions for the central and side quantizers which, under high-resolution assumptions, minimize the expected distortion of a symmetric multiple-description lattice vector quantization (MD-LVQ) system subject to entropy constraints on the side descriptions for given packet-loss probabilities. We consider a special case of the general n-channel symmetric multip... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on expansion in LZ'77-like coding

    Publication Year: 2006, Page(s):1974 - 1989
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB) | HTML iconHTML

    We investigate the maximum increase in number of phrases that results from changing k consecutive symbols in a string x having length n parsed using an LZ'77-like algorithm. We consider a class of compression algorithms that partition a sequence into a collection y of nonoverlapping, variable-length phrases and encode them. Each phrase either is a singleton or matches a substring that starts to it... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sigma-delta (ΣΔ) quantization and finite frames

    Publication Year: 2006, Page(s):1990 - 2005
    Cited by:  Papers (73)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB) | HTML iconHTML

    The K-level Sigma-Delta (ΣΔ) scheme with step size δ is introduced as a technique for quantizing finite frame expansions for Rd. Error estimates for various quantized frame expansions are derived, and, in particular, it is shown that ΣΔ quantization of a unit-norm finite frame expansion in Rd achieves approximation error where N is the frame size... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The security of the FDH variant of Chaum's undeniable signature scheme

    Publication Year: 2006, Page(s):2006 - 2017
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (286 KB) | HTML iconHTML

    In this paper, a new kind of adversarial goal called forge-and-impersonate in undeniable signature schemes is introduced. Note that forgeability does not necessarily imply impersonation ability. The security of the full-domain hash (FDH) variant of Chaum's undeniable signature scheme is then classified according to three dimensions, the goal of adversaries, the attacks, and the zero-knowledge (ZK)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monomial and quadratic bent functions over the finite fields of odd characteristic

    Publication Year: 2006, Page(s):2018 - 2032
    Cited by:  Papers (70)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB) | HTML iconHTML

    Considered are p-ary bent functions having the form f(x)=Trn(σi=0saixdi). A new class of ternary monomial regular bent function with the Dillon exponent is discovered. The existence of Dillon bent functions in the general case is an open problem of deciding whether a certain Kloosterman sum can take on the value -1. Also described is the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Raptor codes on binary memoryless symmetric channels

    Publication Year: 2006, Page(s):2033 - 2051
    Cited by:  Papers (218)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB) | HTML iconHTML

    In this paper, we will investigate the performance of Raptor codes on arbitrary binary input memoryless symmetric channels (BIMSCs). In doing so, we generalize some of the results that were proved before for the erasure channel. We will generalize the stability condition to the class of Raptor codes. This generalization gives a lower bound on the fraction of output nodes of degree 2 of a Raptor co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new family of almost difference sets and some necessary conditions

    Publication Year: 2006, Page(s):2052 - 2061
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (269 KB) | HTML iconHTML

    Almost difference sets have important applications in cryptography and coding theory. In this paper, new families of almost difference sets are constructed. Some necessary conditions for the existence of (v,k,λ,t)-almost difference sets in Zv are derived. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Single-symbol maximum likelihood decodable linear STBCs

    Publication Year: 2006, Page(s):2062 - 2091
    Cited by:  Papers (192)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB) | HTML iconHTML

    Space-time block codes (STBCs) from orthogonal designs (ODs) and coordinate interleaved orthogonal designs (CIOD) have been attracting wider attention due to their amenability for fast (single-symbol) maximum-likelihood (ML) decoding, and full-rate with full-rank over quasi-static fading channels. However, these codes are instances of single-symbol decodable codes and it is natural to ask, if ther... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Upper bounds on the rate of LDPC codes as a function of minimum distance

    Publication Year: 2006, Page(s):2092 - 2100
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    New upper bounds on the rate of low-density parity-check (LDPC) codes as a function of the minimum distance of the code are derived. The bounds apply to regular LDPC codes, and sometimes also to right-regular LDPC codes. Their derivation is based on combinatorial arguments and linear programming. The new bounds improve upon the previous bounds due to Burshtein et al. It is proved that at least for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algebraic lower bounds on the free distance of convolutional codes

    Publication Year: 2006, Page(s):2101 - 2110
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB) | HTML iconHTML

    A new module structure for convolutional codes is introduced and used to establish further links with quasi-cyclic and cyclic codes. The set of finite weight codewords of an (n,k) convolutional code over Fq is shown to be isomorphic to an Fq[x]-submodule of Fq n[x], where Fq n[x] is the ring of polynomials in indeterminate x over F<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear programming bounds for codes in grassmannian spaces

    Publication Year: 2006, Page(s):2111 - 2125
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (417 KB) | HTML iconHTML

    In this paper, we develop the linear programming method to obtain bounds for the cardinality of Grassmannian codes endowed with the chordal distance. We obtain a bound and its asymptotic version that generalize the well-known bound for codes in the real projective space obtained by Kabatyanskiy and Levenshtein, and improve the Hamming bound for sufficiently large minimal distances View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Variable length coding over an unknown channel

    Publication Year: 2006, Page(s):2126 - 2145
    Cited by:  Papers (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB) | HTML iconHTML

    Burnashev in 1976 gave an exact expression for the reliability function of a discrete memoryless channel (DMC) with noiseless feedback. A coding scheme that achieves this exponent needs, in general, to know the statistics of the channel. Suppose now that the coding scheme is designed knowing only that the channel belongs to a family Q of DMCs. Is there a coding scheme with noiseless feedback that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mean-squared error and threshold SNR prediction of maximum-likelihood signal parameter estimation with estimated colored noise covariances

    Publication Year: 2006, Page(s):2146 - 2164
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (858 KB) | HTML iconHTML

    An interval error-based method (MIE) of predicting mean squared error (MSE) performance of maximum-likelihood estimators (MLEs) is extended to the case of signal parameter estimation requiring intermediate estimation of an unknown colored noise covariance matrix; an intermediate step central to adaptive array detection and parameter estimation. The successful application of MIE requires good appro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simple proof of the entropy-power inequality

    Publication Year: 2006, Page(s):2165 - 2166
    Cited by:  Papers (53)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (90 KB) | HTML iconHTML

    This correspondence gives a simple proof of Shannon's entropy-power inequality (EPI) using the relationship between mutual information and minimum mean-square error (MMSE) in Gaussian channels. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

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