By Topic

Information Theory, IEEE Transactions on

Issue 4 • Date April 2009

Filter Results

Displaying Results 1 - 25 of 44
  • Table of contents

    Page(s): C1 - C4
    Save to Project icon | Request Permissions | PDF file iconPDF (52 KB)  
    Freely Available from IEEE
  • IEEE Transactions on Information Theory publication information

    Page(s): C2
    Save to Project icon | Request Permissions | PDF file iconPDF (41 KB)  
    Freely Available from IEEE
  • Two Batch Search With Lie Cost

    Page(s): 1433 - 1439
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (193 KB) |  | HTML iconHTML  

    We consider the problem of searching for an unknown number in the search space U ={0,...,M-1}. q-ary questions can be asked and some of the answers may be wrong. An arbitrary integer weighted bipartite graph Gamma is given, stipulating the cost Gamma(i,j) of each answer jnei when the correct answer is i, i.e., the cost of a wrong answer. Correct answers are supposed to be cost-less. It is assumed that a maximum cost e for the sum of the cost of all wrong answers can be afforded by the responder during the whole search. We provide tight upper and lower bounds for the largest size M = M(q,e,Gamma,n) for which it is possible to find an unknown number x*isinU with n q-ary questions and maximum lie cost e. Our results improve the bounds of Cicalese et al. (2004) and Ahlswede et al. (2008). The questions in our strategies can be asked in two batches of nonadaptive questions. Finally, we remark that our results can be further generalized to a wider class of error models including also unidirectional errors. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exact Characterization of the Minimax Loss in Error Exponents of Universal Decoders

    Page(s): 1440 - 1459
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (442 KB) |  | HTML iconHTML  

    Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMCs) and various ensembles of random codes, are studied by combining the competitive minimax approach, proposed by Feder and Merhav, with Chernoff bound and Gallager's techniques for the analysis of error exponents. In particular, we derive a single-letter expression for the largest, universally achievable fraction xi of the optimum error exponent pertaining to the optimum maximum-likelihood (ML) decoding. Moreover, a simpler single-letter expression for a lower bound to xi is presented. To demonstrate the tightness of this lower bound, we use it to show that xi = 1, for the binary symmetric channel (BSC), when the random coding distribution is uniform over: i) all codes (of a given rate), and ii) all linear codes, in agreement with well-known results. We also show that xi = 1 for the uniform ensemble of systematic linear codes, and for that of time-varying convolutional codes in the bit-error-rate sense. For the latter case, we also derive the corresponding universal decoder explicitly and show how it can be efficiently implemented using a slightly modified version of the Viterbi algorithm which employs two trellises. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Entropy Rate of Hidden Markov Processes Observed Through Arbitrary Memoryless Channels

    Page(s): 1460 - 1467
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (467 KB) |  | HTML iconHTML  

    This paper studies the entropy rate of hidden Markov processes (HMPs) which are generated by observing a discrete-time binary homogeneous Markov chain through an arbitrary memoryless channel. A fixed-point functional equation is derived for the stationary distribution of an input symbol conditioned on all past observations. While the existence of a solution to the fixed-point functional equation is guaranteed by martingale theory, its uniqueness follows from the fact that the solution is the fixed point of a contraction mapping. The entropy or differential entropy rate of the HMP can then be obtained through computing the average entropy of each input symbol conditioned on past observations. In absence of an analytical solution to the fixed-point functional equation, a numerical method is proposed in which the fixed-point functional equation is first converted to a discrete linear system using uniform quantization and then solved efficiently. The accuracy of the computed entropy rate is shown to be proportional to the quantization interval. Unlike many other numerical methods, this numerical solution is not based on averaging over a sample path of the HMP. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear-Codes-Based Lossless Joint Source-Channel Coding for Multiple-Access Channels

    Page(s): 1468 - 1486
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (430 KB) |  | HTML iconHTML  

    A general lossless joint source-channel coding (JSCC) scheme based on linear codes and random interleavers for multiple-access channels (MACs) is presented and then analyzed in this paper. By the information-spectrum approach and the code-spectrum approach, it is shown that a linear code with a good joint spectrum can be used to establish limit-approaching lossless JSCC schemes for correlated general sources and general MACs, where the joint spectrum is a generalization of the input-output weight distribution. Some properties of linear codes with good joint spectra are investigated. A formula on the ldquodistancerdquo property of linear codes with good joint spectra is derived, based on which, it is further proved that, the rate of any systematic codes with good joint spectra cannot be larger than the reciprocal of the corresponding alphabet cardinality, and any sparse generator matrices cannot yield linear codes with good joint spectra. The problem of designing arbitrary rate coding schemes is also discussed. A novel idea called ldquogeneralized puncturingrdquo is proposed, which makes it possible that one good low-rate linear code is enough for the design of coding schemes with multiple rates. Finally, various coding problems of MACs are reviewed in a unified framework established by the code-spectrum approach, under which, criteria and candidates of good linear codes in terms of spectrum requirements for such problems are clearly presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error Exponents for Asymmetric Two-User Discrete Memoryless Source-Channel Coding Systems

    Page(s): 1487 - 1518
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (820 KB) |  | HTML iconHTML  

    We study the transmission of two discrete memoryless correlated sources, consisting of a common and a private source, over a discrete memoryless multiterminal channel with two transmitters and two receivers. At the transmitter side, the common source is observed by both encoders but the private source can only be accessed by one encoder. At the receiver side, both decoders need to reconstruct the common source, but only one decoder needs to reconstruct the private source. We hence refer to this system by the asymmetric two-user source-channel coding system. We derive a universally achievable lossless joint source-channel coding (JSCC) error exponent pair for the two-user system by using a technique which generalizes Csiszar's type-packing lemma (1980) for the point-to-point (single-user) discrete memoryless source-channel system. We next investigate the largest convergence rate of asymptotic exponential decay of the system (overall) probability of erroneous transmission, i.e., the system JSCC error exponent. We obtain lower and upper bounds for the exponent. As a consequence, we establish a JSCC theorem with single-letter characterization and we show that the separation principle holds for the asymmetric two-user scenario. By introducing common randomization, we also provide a formula for the tandem (separate) source-channel coding error exponent. Numerical examples show that for a large class of systems consisting of two correlated sources and an asymmetric multiple-access channel with additive noise, the JSCC error exponent considerably outperforms the corresponding tandem coding error exponent. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reed–Solomon and Simplex Codes for Peak-to-Average Power Ratio Reduction in OFDM

    Page(s): 1519 - 1528
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (884 KB) |  | HTML iconHTML  

    New schemes for peak-to-average power ratio reduction in orthogonal frequency-division multiplexing (OFDM) systems are proposed. Reed-Solomon (RS) and simplex codes are employed to create a number of candidates, from which the best are selected. Thereby, in contrast to existing approaches, the codes are arranged over a number of OFDM frames rather than over the carriers, hence a combination of the principles of multiple signal representation with selection (as done in selected mapping) and the use of channel coding is present. In particular, in multiple-antenna transmission, the proposed schemes do not cause any additional delay, but due to the utilization of the dimension space, additional gains can be achieved. Moreover, the schemes are very flexible; due to the selection step, any criterion of optimality can be taken into account. Besides multiple-antenna transmission, packet transmission is briefly considered, which, moreover, covers the appealing similarities with incremental redundancy check schemes in automatic repeat request (ARQ) applications and with decoding of codes transmitted over the erasure channel. The performance of the schemes is (using some approximations) derived analytically and is covered by numerical results that are in very good agreement with the theory. Significant gains can be achieved with these very flexible and versatile methods. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantifying the Loss of Compress–Forward Relaying Without Wyner–Ziv Coding

    Page(s): 1529 - 1533
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (187 KB) |  | HTML iconHTML  

    The compress-and-forward (CF) strategy achieves the optimal diversity-multiplexing tradeoff (DMT) of a three-node half-duplex relay network in slow fading, under the assumption that the relay has perfect knowledge of all three channel coefficients and that the relay makes use of Wyner-Ziv (WZ) source coding with side information. This paper studies the achievable DMT of the same network when the relay is constrained to make use of standard (non-WZ) source coding. Under a short-term power constraint at the relay, using source coding without side information results in a significant loss in terms of the DMT. For multiplexing gains r les 2/3, this loss can be fully compensated for by using power control at the relay. On the contrary, for r isin (2/3,1), the loss with respect to WZ coding remains significant. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Certain Large Random Hermitian Jacobi Matrices With Applications to Wireless Communications

    Page(s): 1534 - 1554
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (535 KB) |  | HTML iconHTML  

    In this paper we study the spectrum of certain large random Hermitian Jacobi matrices. These matrices are known to describe certain communication setups. In particular, we are interested in an uplink cellular channel which models mobile users experiencing a soft-handoff situation under joint multicell decoding. Considering rather general fading statistics we provide a closed-form expression for the per-cell sum-rate of this channel in high signal-to-noise ratio (SNR), when an intra-cell time-division multiple-access (TDMA) protocol is employed. Since the matrices of interest are tridiagonal, their eigenvectors can be considered as sequences with second-order linear recurrence. Therefore, the problem is reduced to the study of the exponential growth of products of two-by-two matrices. For the case where K users are simultaneously active in each cell, we obtain a series of lower and upper bound on the high-SNR power offset of the per-cell sum-rate, which are considerably tighter than previously known bounds. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-SNR Capacity of Noncoherent Fading Channels

    Page(s): 1555 - 1574
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (407 KB) |  | HTML iconHTML  

    Discrete-time Rayleigh-fading single-input single-output (SISO) and multiple-input multiple-output (MIMO) channels are considered, with no channel state information at the transmitter or the receiver. The fading is assumed to be stationary and correlated in time, but independent from antenna to antenna. Peak-power and average-power constraints are imposed on the transmit antennas. For MIMO channels, these constraints are either imposed on the sum over antennas, or on each individual antenna. For SISO channels and MIMO channels with sum power constraints, the asymptotic capacity as the peak signal-to-noise ratio (SNR) goes to zero is identified; for MIMO channels with individual power constraints, this asymptotic capacity is obtained for a class of channels called transmit separable channels. The results for MIMO channels with individual power constraints are carried over to SISO channels with delay spread (i.e., frequency-selective fading). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Throughput of Secure Hybrid-ARQ Protocols for Gaussian Block-Fading Channels

    Page(s): 1575 - 1591
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1003 KB) |  | HTML iconHTML  

    The focus of this paper is an information-theoretic study of retransmission protocols for reliable packet communication under a secrecy constraint. The hybrid automatic retransmission request (HARQ) protocol is revisited for a block-fading wiretap channel. Here, two legitimate users communicate over a block-fading channel in the presence of a passive eavesdropper who intercepts the transmissions through an independent block-fading channel. In this model, the transmitter obtains a 1-bit ACK/NACK feedback from the legitimate receiver via an error-free public channel. Both reliability and confidentiality of secure HARQ protocols are studied through the joint consideration of channel coding, secrecy coding, and retransmission protocols. In particular, the error and secrecy performance of repetition time diversity (RTD) and incremental redundancy (INR) protocols are investigated based on Wyner code sequences. These protocols ensure that the confidential message is decoded successfully by the legitimate receiver and is kept completely secret from the eavesdropper for a set of channel realizations. This paper illustrates that there exists a rate-compatible Wyner code family which ensures a secure INR protocol. Further, it defines the connection outage and secrecy outage probabilities to characterize the tradeoff between the reliability of the legitimate communication link and the confidentiality with respect to the eavesdropper's link. For a given connection/secrecy outage probability pair, an achievable throughput of secure HARQ protocols is derived for block-fading channels. Finally, both asymptotic analysis and numerical calculations demonstrate the benefits of HARQ protocols to throughput and secrecy. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Analysis and Design Criteria of BICM-ID With Signal Space Diversity for Keyhole Nakagami- m Fading Channels

    Page(s): 1592 - 1602
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (422 KB) |  | HTML iconHTML  

    This paper generalizes the application bit-interleaved coded modulation with iterative decoding (BICM-ID) using signal space diversity (SSD) over keyhole Nakagami-m fading channels. The tight union bound on the asymptotic error performance is first analytically derived. The near-optimal rotation matrix with respect to both the asymptotic performance and the convergence behavior is then determined. In particular, it is demonstrated that the suitable rotation matrix is the one that has 1) all entries equal in magnitude, 2) a high diversity order, and 3) a large minimum product of the ratios between squared distances to the power m and log-squared distances to the power m of the rotated constellation scaled by factors of signal-to-noise ratio (SNR) and the parameter m . Various analytical and simulation results show that by employing SSD with a sufficiently large dimension, the error performance can closely approach that over an additive white Gaussian noise (AWGN) channel, even in the worst case of keyhole fading. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information Theoretic Bounds for Compound MIMO Gaussian Channels

    Page(s): 1603 - 1617
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (515 KB) |  | HTML iconHTML  

    In this paper, achievable rates for compound Gaussian multiple-input-multiple-output (MIMO) channels are derived. Two types of channels, modeled in the frequency domain, are considered when: 1) the channel frequency response matrix H belongs to a subset of H infin normed linear space, and 2) the power spectral density (PSD) matrix of the Gaussian noise belongs to a subset of L 1 space. The achievable rates of these two compound channels are related to the maximin of the mutual information rate. The minimum is with respect to the set of all possible H matrices or all possible PSD matrices of the noise. The maximum is with respect to all possible PSD matrices of the transmitted signal with bounded power. For the compound channel modeled by the set of H matrices, it is shown, under certain conditions, that the code for the worst case channel can be used for the whole class of channels. For the same model, the water-filling argument implies that the larger the set of matrices H, the smaller the bandwidth of the transmitted signal will be. For the second compound channel, the explicit relation between the maximizing PSD matrix of the transmitted signal and the minimizing PSD matrix of the noise is found. Two PSD matrices are related through a Riccati equation, which is always present in Kalman filtering and liner-quadratic Gaussian control problems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diversity Gains of Power Control With Noisy CSIT in MIMO Channels

    Page(s): 1618 - 1626
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (299 KB) |  | HTML iconHTML  

    A multi antenna channel with partial channel state information at the transmitter (CSIT) is studied. The partial CSIT takes the form of the channel matrix corrupted by additive white Gaussian noise (AWGN) with a variance that is assumed to decay as a power of the signal-to-noise ratio (SNR). It is shown that under a long-term power constraint and in the regime of asymptotically high SNR, a large diversity gain over the channel can be achieved by using rarely a high power at the transmitter that compensates for bad channel realizations. Examples relating the diversity gain of the systems with the channel Doppler bandwidth are discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Orthogonal space-time block codes with sphere packing

    Page(s): 1627 - 1639
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (477 KB) |  | HTML iconHTML  

    Orthogonal designs have received considerable attention in the development of efficient modulation and coding methods for future multi-antenna wireless communication systems due to their special properties. In this paper, we propose a class of space-time block codes constructed by combining orthogonal designs with sphere packing for an arbitrary number of transmit antennas. The structure of the orthogonal designs is exploited to guarantee full diversity, and sphere packing is used to improve the coding advantage. Space-time block code construction from block-orthogonal designs is also considered: the full-diversity property is ensured by rotating the sphere packing underlying the code, and the optimal rotation angle is determined for a class of sphere packing. Code design examples are provided for two and four transmit antennas and various transmission rates. The simulation results show that by jointly designing the symbols in the orthogonal designs, the performance of the block codes can be significantly increased. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust Precoder Adaptation for MIMO Links With Noisy Limited Feedback

    Page(s): 1640 - 1649
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (728 KB) |  | HTML iconHTML  

    In this paper, we propose two robust limited feedback designs for multiple-input multiple-output (MIMO) adaptation. The first scheme, namely, the combined design jointly optimizes the adaptation, CSIT (channel state information at the transmitter) feedback as well as index assignment strategies. The second scheme, namely, the decoupled design, focuses on the index assignment problem given an error-free limited feedback design. Simulation results show that the proposed framework has significant capacity gain compared to the naive design (designed assuming there is no feedback error). Furthermore, for large number of feedback bits C fb, we show that under two-nearest constellation feedback channel assumption, the MIMO capacity loss (due to noisy feedback) of the proposed robust design scales like O(Pe2-[( C fb)/(t+1)]) for some positive integer t. Hence, the penalty due to noisy limited feedback in the proposed robust design approaches zero as C fb increases. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Random Sensory Networks: A Delay Analysis

    Page(s): 1650 - 1664
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (722 KB) |  | HTML iconHTML  

    A fundamental function performed by a sensory network is the retrieval of data gathered collectively by sensor nodes. The metrics that measure the efficiency of this data collection process are time and energy. In this paper, we study via simple discrete mathematical models, the statistics of the data collection time in sensory networks. Specifically, we analyze the average minimum delay in collecting randomly located/distributed sensors data for networks of various topologies when the number of nodes becomes large. Furthermore, we analyze the impact of various parameters such as size of packet, transmission range, and channel erasure probability on the optimal time performance. Our analysis applies to directional antenna systems as well as omnidirectional ones. This paper focuses on directional antenna systems and briefly presents results on omnidirectional antenna systems. Finally, a simple comparative analysis shows the respective advantages of the two systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Analysis of Contention Based Medium Access Control Protocols

    Page(s): 1665 - 1682
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (594 KB) |  | HTML iconHTML  

    This paper studies the performance of contention based medium access control (MAC) protocols. In particular, a simple and accurate technique for estimating the throughput of the IEEE 802.11 DCF protocol is developed. The technique is based on a rigorous analysis of the Markov chain that corresponds to the time evolution of the back-off processes at the contending nodes. An extension of the technique is presented to handle the case where service differentiation is provided with the use of heterogeneous protocol parameters, as, for example, in IEEE 802.11e EDCA protocol. Our results provide new insights into the operation of such protocols. The techniques developed in the paper are applicable to a wide variety of contention based MAC protocols. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of Optimal High Resolution and Fixed Rate Scalar Quantization

    Page(s): 1683 - 1691
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (219 KB) |  | HTML iconHTML  

    In 2001, Hui and Neuhoff proposed a uniform quantizer with overload for the quantization of scalar signals and derived the asymptotically optimal size of the quantization bins in the high-bitrate limit. The purpose of the present paper is to prove a quantitatively more precise version of this result which, at the same time, is valid for a more general, quite natural class of probability distributions that requires only little regularity and includes, for instance, positive Lipschitz-continuous functions of unit integral. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Expected Codeword Length Per Symbol of Optimal Prefix Codes for Extended Sources

    Page(s): 1692 - 1695
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (121 KB) |  | HTML iconHTML  

    Given a discrete memoryless source X, it is well known that the expected codeword length per symbol L n(X) of an optimal prefix code for the extended source X n converges to the source entropy as n approaches infinity. However, the sequence L n(X) need not be monotonic in n , which implies that the coding efficiency cannot be increased by simply encoding a larger block of source symbols (unless the block length is appropriately chosen). As the encoding and decoding complexity increases exponentially with the block length, from a practical perspective it is useful to know when an increase in the block length guarantees a decrease in the expected codeword length per symbol. While this paper does not provide a complete answer to that question, we give some properties of L n(X) and obtain for each nges1 and nondyadic p 1 n ( p 1 is the probability of the most likely source symbol) an integer k* for which L kn(X)<L n(X) for all kgesk*, implying that the coding efficiency of encoding blocks of length kn is higher than that of encoding blocks of length n for all kgesk*. This question is simpler in part because L kn(X)lesL n(X) is guaranteed for all nges1 and kges1, but our results distinguish scenarios where increasing the multiplicative factor guarantees strict improvement. These results extend and generalize those by Montgomery and Kumar. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Construction of Variable Length Codes With Good Synchronization Properties

    Page(s): 1696 - 1700
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (217 KB) |  | HTML iconHTML  

    Variable length codes offer advantages for data compression, but are susceptible to loss of synchronization if a bit error occurs. This can be mitigated by the use of variable length codes with specific mechanisms for resynchronization. Such mechanisms exist in the codes known as Huffman Equivalent (HE) codes and T-codes. These have been extensively studied in the literature. For optimal compression a length vector is obtained from the probabilities of the symbols of the alphabet used. However, HE-codes and T-codes do not exist for all length vectors. In this paper, a new class of variable length codes with good synchronization properties is developed. These are referred to as ordered termination (OT) codes. OT-codes do exist for all length vectors. Experimental results and some theoretical support suggest that OT-codes compare favorably with HE- and T-codes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Results on Multiple Descriptions in the Wyner-Ziv Setting

    Page(s): 1701 - 1708
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (185 KB) |  | HTML iconHTML  

    Some new results of multiple descriptions in the Wyner-Ziv setting (MDWZ) are presented. MDWZ uses two pieces of side information (SI) for two different side decoders. Both SI are available to the central decoder, but none to the encoder. The complete achievable region for a quadratic Gaussian MDWZ system is derived. This result is an extension of Ozarow's result on multiple descriptions of a Gaussian source without SI and Diggavi-Vaishampayan's result on common SI. It is shown that a refinement layer for the central decoder is indispensable if the central distortion is sufficiently small. The tight rate distortion region is also given if one of the side decoders is required to perfectly reconstruct a deterministic function of the source. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Practical Design for Joint Distributed Source and Network Coding

    Page(s): 1709 - 1720
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (752 KB) |  | HTML iconHTML  

    This paper considers the problem of communicating correlated information from multiple source nodes over a network of noiseless channels to multiple destination nodes, where each destination node wants to recover all sources. The problem involves a joint consideration of distributed compression and network information relaying. Although the optimal rate region has been theoretically characterized, it was not clear how to design practical communication schemes with low complexity. This work provides a partial solution to this problem by proposing a low-complexity scheme for the special case with two sources whose correlation is characterized by a binary symmetric channel. Our scheme is based on a careful combination of linear syndrome-based Slepian-Wolf coding and random linear mixing (network coding). It is in general suboptimal; however, its low complexity and robustness to network dynamics make it suitable for practical implementation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cyclic Lowest Density MDS Array Codes

    Page(s): 1721 - 1729
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (251 KB) |  | HTML iconHTML  

    Three new families of lowest density maximum-distance separable (MDS) array codes are constructed, which are cyclic or quasi-cyclic. In addition to their optimal redundancy (MDS) and optimal update complexity (lowest density), the symmetry offered by the new codes can be utilized for simplified implementation in storage applications. The proof of the code properties has an indirect structure: first MDS codes that are not cyclic are constructed, and then transformed to cyclic codes by a minimum-distance preserving transformation. 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