By Topic

IEEE Transactions on Information Theory

Issue 8 • Aug. 2005

Filter Results

Displaying Results 1 - 25 of 34
  • Table of contents

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

    Publication Year: 2005, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (37 KB)
    Freely Available from IEEE
  • Insufficiency of linear coding in network information flow

    Publication Year: 2005, Page(s):2745 - 2759
    Cited by:  Papers (188)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB) | HTML iconHTML

    It is known that every solvable multicast network has a scalar linear solution over a sufficiently large finite-field alphabet. It is also known that this result does not generalize to arbitrary networks. There are several examples in the literature of solvable networks with no scalar linear solution over any finite field. However, each example has a linear solution for some vector dimension great... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal sequences and sum capacity of symbol asynchronous CDMA systems

    Publication Year: 2005, Page(s):2760 - 2769
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (274 KB) | HTML iconHTML

    The optimal signature sequences that maximize the sum capacity of a direct sequence code-division multiple-access (CDMA) system are characterized in the general case of symbol delay profile and user power constraints. It is shown that the optimal sum capacity of the symbol asynchronous system equals that of the symbol synchronous system with the same user power constraints. With the optimal signat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal decoding for frequency-selective fading channels

    Publication Year: 2005, Page(s):2770 - 2790
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB) | HTML iconHTML

    We address the problem of universal decoding in unknown frequency-selective fading channels, using an orthogonal frequency-division multiplexing (OFDM) signaling scheme. A block-fading model is adopted, where the bands' fading coefficients are unknown yet assumed constant throughout the block. Given a codebook, we seek a decoder independent of the channel parameters whose worst case performance re... View full abstract»

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

    Publication Year: 2005, Page(s):2791 - 2811
    Cited by:  Papers (37)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB) | HTML iconHTML

    We present an extensive study of symmetric Boolean functions, especially of their cryptographic properties. Our main result establishes the link between the periodicity of the simplified value vector of a symmetric Boolean function and its degree. Besides the reduction of the amount of memory required for representing a symmetric function, this property has some consequences from a cryptographic p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The statistical strength of nonlocality proofs

    Publication Year: 2005, Page(s):2812 - 2835
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB) | HTML iconHTML

    There exist numerous proofs of Bell's theorem, stating that quantum mechanics is incompatible with local realistic theories of nature. Here the strength of such nonlocality proofs is defined in terms of the amount of evidence against local realism provided by the corresponding experiments. Statistical considerations show that the amount of evidence should be measured by the Kullback-Leibler (KL) o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Block codes for the hard-square model

    Publication Year: 2005, Page(s):2836 - 2848
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB) | HTML iconHTML

    The hard-square model is a two-dimensional (2-D) constrained system consisting of all binary arrays on a rectangular grid in which 1's are isolated both horizontally and vertically. This paper proposes algorithms to search for single-state and finite-state block codes with rectangular codewords that satisfy the hard-square constraint. Although the codeword size is small, single-state block codes w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Locally testable cyclic codes

    Publication Year: 2005, Page(s):2849 - 2858
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB) | HTML iconHTML

    Cyclic linear codes of block length n over a finite field Fq are linear subspaces of Fqn that are invariant under a cyclic shift of their coordinates. A family of codes is good if all the codes in the family have constant rate and constant normalized distance (distance divided by block length). It is a long-standing open problem whether there exists a good family o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New code upper bounds from the Terwilliger algebra and semidefinite programming

    Publication Year: 2005, Page(s):2859 - 2866
    Cited by:  Papers (55)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (322 KB) | HTML iconHTML

    We give a new upper bound on the maximum size A(n,d) of a binary code of word length n and minimum distance at least d. It is based on block-diagonalizing the Terwilliger algebra of the Hamming cube. The bound strengthens the Delsarte bound, and can be calculated with semidefinite programming in time bounded by a polynomial in n. We show that it improves a number of known upper bounds for concrete... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding for the degraded broadcast channel with random parameters, with causal and noncausal side information

    Publication Year: 2005, Page(s):2867 - 2877
    Cited by:  Papers (69)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (438 KB) | HTML iconHTML

    In this work, coding for the degraded broadcast channel controlled by random parameters is studied. Two main paradigms are considered: where side information on the random parameters is provided to the transmitter in a noncausal manner (termed here noncausal coding), and where side information is provided in a causal manner (termed causal coding). Inner and outer bounds are derived on the capacity... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the capacity of network coding for random networks

    Publication Year: 2005, Page(s):2878 - 2885
    Cited by:  Papers (75)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (362 KB) | HTML iconHTML

    We study the maximum flow possible between a single-source and multiple terminals in a weighted random graph (modeling a wired network) and a weighted random geometric graph (modeling an ad-hoc wireless network) using network coding. For the weighted random graph model, we show that the network coding capacity concentrates around the expected number of nearest neighbors of the source and the termi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improvement to the bit stuffing algorithm

    Publication Year: 2005, Page(s):2885 - 2891
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB) | HTML iconHTML

    The bit stuffing algorithm is a technique for coding constrained sequences by the insertion of bits into an arbitrary data sequence. This approach was previously introduced and applied to (d,k) constrained codes. Results show that the maximum average rate of the bit stuffing code achieves capacity when k=d+1 or k=∞, while it is suboptimal for all other (d,k) pairs. Furthermore, this techniqu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The second support weight distribution of the Kasami codes

    Publication Year: 2005, Page(s):2892 - 2894
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB) | HTML iconHTML

    We compute the second support weight distribution of the Kasami codes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quasi-cyclic LDPC codes for fast encoding

    Publication Year: 2005, Page(s):2894 - 2901
    Cited by:  Papers (157)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (346 KB) | HTML iconHTML

    In this correspondence we present a special class of quasi-cyclic low-density parity-check (QC-LDPC) codes, called block-type LDPC (B-LDPC) codes, which have an efficient encoding algorithm due to the simple structure of their parity-check matrices. Since the parity-check matrix of a QC-LDPC code consists of circulant permutation matrices or the zero matrix, the required memory for storing it can ... View full abstract»

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

    Publication Year: 2005, Page(s):2901 - 2905
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (235 KB) | HTML iconHTML

    A pair of posets (P,Q ) on [n] is called a weak dual MacWilliams pair (wdMp) if the P-weight enumerator of a linear code uniquely determines the Q-weight enumerator of the dual of that code for every linear code of length n over a finite field. First, we show that (P, Pbreve) is a wdMp if and only if the group of all P-weight preserving linear automorphisms of the ambient n-dimensional space over ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new family of nonbinary sequences with three-level correlation property and large linear span

    Publication Year: 2005, Page(s):2906 - 2914
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB) | HTML iconHTML

    In this correspondence, we present a new family of nonbinary sequences with three-level nontrivial correlations and large linear complexity. The sequences may be considered as nonlinear analogues of the well-known sequences by Trachtenberg and Helleseth. It is shown that the family is optimal with respect to the Welch bound in terms of root mean square of all nontrivial correlations. We also deter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantum codes from concatenated algebraic-geometric codes

    Publication Year: 2005, Page(s):2915 - 2920
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (274 KB) | HTML iconHTML

    We apply Steane's enlargement of the Calderbank-Shor-Steane (CSS) codes and additive codes over F4 to concatenated algebraic-geometric codes to construct many good quantum codes with fewer restrictions on the parameters compared to some known quantum codes. Some of the quantum codes we have constructed are either optimal or have parameters as good as the best known codes, while some hav... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust deconvolution of deterministic and random signals

    Publication Year: 2005, Page(s):2921 - 2929
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (351 KB) | HTML iconHTML

    We consider the problem of designing an estimation filter to recover a signal x[n] convolved with a linear time-invariant (LTI) filter h[n] and corrupted by additive noise. Our development treats the case in which the signal x[n] is deterministic and the case in which it is a stationary random process. Both formulations take advantage of some a priori knowledge on the class of underlying signals. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • List detection for the K-symmetric multiple-access channel

    Publication Year: 2005, Page(s):2930 - 2936
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    A K-symmetric channel is a K-user linear multiple-access channel in which the cross correlations between each pair of users are identical. The main contribution of this correspondence is an algorithm which finds the P sequences with highest a posteriori probability (APP) in the case of binary transmission over a K-symmetric channel with additive white Gaussian noise. This list detector is applied ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum diversity in single-carrier frequency-domain equalization

    Publication Year: 2005, Page(s):2937 - 2940
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (173 KB) | HTML iconHTML

    In broadband wireless communications, multipath propagation often results in an overall channel with a long impulse response that could span tens or even hundreds of symbol intervals. To equalize such long channels, conventional single-carrier time-domain equalization becomes infeasible due to high computational complexity. Relying on the use of fast Fourier transform, single-carrier frequency-dom... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the universality of Burnashev's error exponent

    Publication Year: 2005, Page(s):2940 - 2944
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    We consider communication over a time-invariant discrete memoryless channel (DMC) with noiseless and instantaneous feedback. We assume that the transmitter and the receiver are not aware of the underlying channel, however, they know that it belongs to some specific family of DMCs. Recent results show that for certain families (e.g., binary-symmetric channels and Z channels) there exist coding sche... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On error exponents in hypothesis testing

    Publication Year: 2005, Page(s):2945 - 2950
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (310 KB) | HTML iconHTML

    The classical result of Blahut, which characterizes achievable error exponents in binary hypothesis testing, is generalized in two different directions. First, in M-ary hypothesis testing, the tradeoff of all M(M-1) types of error exponents and corresponding optimal decision schemes are explored. Then, motivated by a power-constrained distributed detection scenario, binary hypothesis testing is re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semidefinite programming bounds on the probability of error of binary communication systems with inexactly known intersymbol interference

    Publication Year: 2005, Page(s):2951 - 2954
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (174 KB) | HTML iconHTML

    We consider the problem of evaluating the probability of error of binary communication systems in the presence of additive noise and intersymbol interferences whose statistics are inexactly known due to the estimation errors of the channel coefficients. We present a new method using semidefinite programming to evaluate tight bounds on the error probability based on the upper and lower bounds on th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bandwidth management in distributed sequential detection

    Publication Year: 2005, Page(s):2954 - 2961
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB) | HTML iconHTML

    The problem of distributed sequential detection in the presence of communication constraints is considered. The observations available at each sensor are first compressed to multibit sensor decisions and sent to the fusion center. At the fusion center, a sequential data fusion scheme is implemented in order to reach a global decision. An algorithm is developed for optimal bandwidth distribution am... 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
Frank R. Kschischang

Department of Electrical and Computer Engineering