NDLI: Structured LDPC codes over GF(2/sup m/) and companion matrix based decoding

Please wait, while we are loading the content...

2015 IEEE International Symposium on Information Theory (ISIT)

2014 IEEE International Symposium on Information Theory

2013 IEEE International Symposium on Information Theory

2012 IEEE International Symposium on Information Theory Proceedings

2011 IEEE International Symposium on Information Theory Proceedings

2010 IEEE International Symposium on Information Theory

2009 IEEE International Symposium on Information Theory

2008 IEEE International Symposium on Information Theory

2007 IEEE International Symposium on Information Theory

2006 IEEE International Symposium on Information Theory

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.

International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.

Proceedings. 2004 IEEE International Symposium on Information Theory (IEEE Cat. No.04CH37522)

Proceedings 2004 IEEE International Symposium on Information Theory

Program committee

Acknowledgment of financial support

Table of contents

Plenary Sessions

On achievable rate regions for the Gaussian interference channel

Capacity approaching codes for relay channels

An achievable rate for the multiple level relay channel

Improved achievable rates for user cooperation and relay channels

On the trade-off between rate and performance of expander codes on AWGN channels

On nearly-MDS expander codes

Distance properties of expander codes

The average weight distribution of Tanner code ensembles and a way to modify them to improve their weight distribution

On the entropy of a Hidden Markov process

On the entropy rate of a hidden Markov model

On the redundancy of HMM patterns

Large deviations performance of predictors for Markov sources

Efficient key agreement and signature schemes using compact representations in GF(p/sup 10/)

Secret key agreement from correlated source outputs using LDPC matrices

Attacks on a secure group communication scheme with hierarchical access control

Optimal multiple assignments based on integer programming in secret sharing schemes

The feasibility of matchings in a wireless network

Fast transmission in ad hoc networks

Efficient routing in wireless networks with random node distribution

Realizing MIMO gains without user cooperation in large single-antenna wireless networks

On the optimality of coloring with a lattice

Optimal interleaving schemes for correcting 2-D cluster errors

Optimal t-interleaving on tori

Relative redundancy: a more stringent performance guarantee for universal compression

Average case universal lossless compression with unknown alphabets

Prediction and adaptive coding of sources with large or infinite alphabet

Code design for lossless multiterminal networks

Information closures of exponential families

The weak information projection

Jensen-Shannon divergence and Hilbert space embedding

A distribution dependent refinement of Pinsker's inequality

Cut-set arguments for source-channel networks

Cut sets and information flow in networks of two-way channels

On optimal multiresolution source-channel coding across degraded broadcast channels

Zero-error communication over networks

Finite length analysis of LT codes

Rateless codes on noisy channels

Raptor codes on symmetric channels

On minimum entropy graph colorings

On the maximum entropy theorem for complex random vectors

On the relation between the Shannon entropy and the von Neumann entropy

Entropy measures of physics via complexity

Achieving the perfect secrecy for the Gaussian wiretap channel with side information

Generalized coset schemes for the wire-tap channel: application to biometrics

The private key capacity region for three terminals

Rates for bit commitment and coin tossing from noisy correlation

Space-time codes from property-L

Capacity-achieving multiple coding for MIMO Rayleigh fading systems

Detectors and asymptotic analysis for bandwidth-efficient space-time multiple-access systems

An iterative channel estimation scheme for beamforming transmission and detection in MIMO systems

Contention-free interleavers

On bit-interleaved turbo-coded modulation with low error floors

Short-cycle-free interleaver design for increasing minimum squared Euclidean distance

Interleavers for turbo codes that yield a minimum distance growing with blocklength

Bounds on expansion in LZ'77-like coding

Linear time universal coding of tree sources via FSM closure

Error resilient LZ'77 scheme and its analysis

On certain pathwise properties of the sliding-window Lempel Ziv algorithm

Optimization of matrix monotone functions: saddle-point, worst case noise analysis, and applications

A new proof of Parisi's conjecture for the finite random assignment problem

On a conjecture of Majani and Rumsey

An approximation of the Gilbert-Elliott channel via a queue-based channel model

A geometrical investigation of the rank-1 Ricean MIMO channel at high SNR

Noncoherent MIMO communication: Grassmannian constellations and efficient detection

Optimal linear precoding for BICM over MIMO channels

Lower bounds on the minimum pseudoweight of linear codes

Pseudocodeword weights and stopping sets

LP decoding corrects a constant fraction of errors

Analysis of an algorithm for irregular LDPC code construction

Capacity-achieving feedback scheme for Markov channels with channel state information

On a capacity achieving scheme for the colored Gaussian channel with feedback

Linear Gaussian channels: feedback capacity under power constraints

On the sufficiency of power control for a class of channels with feedback

A class of algebraic-geometric codes for Lee-Metric and their decoding

The missing evaluation codes from order domain theory

Algebraic-geometric codes on the erasure channel

Pseudonoise sequences based on algebraic function fields

Information retrieval and processing in sensor networks: deterministic scheduling vs. random access

Computing and communicating statistics in sensor networks

Sensor network devolution and breakdown in survivor connectivity

Delay issues in linear sensory networks

Recursive construction of Golay sequences

A new optimal double periodical construction of one target two-dimensional arrays

Multisequences with d-perfect property

Generalized binary Udaya-Siddiqi sequences

Sliding-block decodable encoders between (d, k)-constrained systems of equal capacity

A convolution interpretation of (M,d,k) run-length-limited capacity

On guided scrambling with guaranteed maximum run-length constraints

An algorithm to enumerate codewords for third-order spectral-null codes

On second-order properties of minimum redundancy block codes

Redundancy-complexity tradeoff of multiresolution coding for successively refinable sources

Variable-to-variable codes with small redundancy rates

Bounds on the expected cost of one-to-one codes

Decision-feedback equalization achieves full diversity for finite delay spread channels

Diversity/multiplexing tradeoff in ISI channels

Permutation codes: achieving the diversity-multiplexing tradeoff

On the optimality of lattice space-time (LAST) coding

Generalized unified construction of space-time codes with optimal rate-diversity tradeoff

On the effect of parity-check weights in iterative decoding

Further results on finite-length scaling for iteratively decoded LDPC ensembles

Weight distributions of LDPC code ensembles: combinatorics meets statistical physics

Concentration theorem for tripartite LDPC codes

On the complexity of exact maximum likelihood decoding on tail-biting trellises

Achievable rates for multiple-access channels with correlated messages

On the multiple-access channel with rate-limited state information at the encoders

On the structure of the capacity region of the Gaussian multiple access channel

Channel configuration of multiple-access channel

Construction of new signature codes for the T-terminal binary adder multiple access channel with partially active users

Scheduling for efficient data broadcast over two channels

Optimal universal schedules for discrete broadcast

Throughput optimal power and rate control for queued multiaccess and broadcast communications

An analysis of blocking switches using error control codes

Large deviation in a two-servers system with dynamic routing

Robust coding schemes for distributed sensor networks with unreliable sensors

Communicating to colocated ad-hoc receiving nodes in a fading environment

Rate region of the quadratic Gaussian CEO problem

On interacting encoders and decoders in multiuser settings

Coding and routing complexity in sensor networks

Results on the nonlinear span of binary sequences

Linear complexity over F/sub p/ of Sidel'nikov sequences

Asymptotic behavior of normalized linear complexity of ultimately non-periodic binary sequences

Multiple-shift complementary sequences and their peak-to-average power ratio values

Determinants of binary circulant matrices

High-throughput error correcting space-time block codes

Information-lossless STBCs from crossed-product algebras

On the decoding and diversity-multiplexing gain tradeoff of a recent multilevel construction of space-time codes

STBCs with optimal diversity-multiplexing tradeoff for 2, 3 and 4 transmit antennas

Bayesian and nonBayesian methods for iterative joint decoding and detection in the presence of phase noise

On the soft-decision in the iterative receiver for coded MIMO systems

Minimum mean square error equalization using priors for two-dimensional intersymbol interference

Linear equalization via factor graphs

Joint delayed-decision feedback sequence estimation with adaptive state allocation

A family of quantum protocols

Security of quantum key distribution with imperfect devices

Reliability of Calderbank-Shor-Steane codes and security of quantum key distribution

Quantum key distribution with vacua or dim pulses as decoy states

On intrinsic information

An information theoretic model for physical uncloneable functions

A differential approach to a polynomial equivalence problem

Minimax regret portfolios for restricted stock sequences

Language evolution and information theory

Byzantine modification detection in multicast networks using randomized network coding

Subtree decomposition for network coding

A comparison of network coding and tree packing

Convolutional network codes

Maximum likelihood decoding of trellis codes in fading channels with no receiver CSI is a polynomial-complexity problem

The effect of channel side information at transmitter on coding complexity

Coding for the variably coherent channel

Entropy amplification by aperiodic noise and side information problems

Optimal puncturing for multiple parallel concatenated codes

Puncturing for finite length low-density parity-check codes

Rate-compatible low-density parity-check codes

Rate-compatible array LDPC codes

Rotationally invariant space time constellations

Low-density parity-check space-time codes: performance analysis and code construction

Upper bound analysis of diversity for unitary space time constellations

On the BCJR-like trellis for space-time group codes

Capacity bounds for the hard-triangle model

Block codes for the hard-square model

Finite state models of constrained 2D data

Analysis of bit-stuffing codes and lower bounds on capacity for 2-D constrained arrays using quasistationary measures

Channel decoding of systematically encoded unknown redundant sources

Source-controlled turbo coding of nonuniform memoryless sources based on unequal energy allocation

Universal lossless source controlled channel decoding

The binary reflected Gray code is optimal for M-PSK

Consistent estimation of the basic neighborhood of Markov random fields

Optimal Bregman prediction and Jensen's equality

A principle of minimum expected risk

Maximum entropy models: convergence rates and applications in dynamic system monitoring

Minimum redundancy tree for key distribution in secure multicast

Information-theoretic approach to privacy protection of biometric templates

A point-subset compression algorithm for fiber-based certificates of authenticity

The capacity region of the Gaussian MIMO broadcast channel

Minimax duality of Gaussian vector broadcast channels

Broadcast channels with cooperating receivers: a downlink for the sensor reachback problem

Scaling laws of sum rate using time-sharing, DPC, and beamforming for MIMO broadcast channels

Computation of information rates by particle methods

Numerical capacity analysis of time varying fading channels using finite state Markov models

A generalization of Arimoto-Blahut algorithm

Blahut-Arimoto algorithms for computing channel capacity and rate-distortion with side information

Bounds on the minimum distances of a class of q-ary images of q/sup m/-ary irreducible cyclic codes

On existence of good self-dual quasicyclic codes

Quasicyclic irreducible Goppa codes

On multiple burst-correcting shortened cyclic codes

On optimal cyclotomic lattices and diagonal-single-layer space-time block codes

Improving the diversity product of space-time Hamiltonian constellations

On the random coding exponent of multiple antenna systems using space-time block codes

Higher order differential matrix modulation

An improvement to the bit stuffing algorithm

Encoding algorithms for 2 dimensional run-length-limited constraints

Tradeoff functions for constrained systems with unconstrained positions

A Ramsey theory approach to ghostbusting

Fixed binning schemes: an operational duality between channel and source coding problems with side information

On joint information embedding and lossy compression

On causal and semicausal codes for joint information embedding and source coding

Uniquely decodable multiple access source codes

On the optimality of symbol by symbol filtering and denoising

Universal denoising for the finite-input-general-output channel

Universal minimax discrete denoising under channel uncertainty

Universal piecewise linear least squares prediction

Random coding technique for digital fingerprinting codes: fighting two pirates revisited

Fighting three pirates with scattering codes

Good ternary 2-traceability codes exist

Universal hash functions over GF(2/sup n/)

Asymptotic weight and stopping set distributions for detailedly represented irregular LDPC code ensembles

Relations between belief propagation on erasure and symmetric channels

Performance of low-density parity-check codes with linear minimum distance

Capacity-achieving ensembles for the binary erasure channel with bounded complexity

Compressing encrypted sources using side-information coding

Encoder side information is useful in source coding

Source coding with feedforward: Gaussian sources

Collaborative algorithms for bandwidth and allocation in wireless networks

Capacity and dirty paper coding for Gaussian broadcast channels with common information

Water filling for uncoded communications over parallel Gaussian channels

Joint power and bandwidth allocation in downlink transmission

The error exponent for finite-hypothesis channel identification

Asymptotic robust Neyman-Pearson hypothesis testing based on moment classes

Towards an information theoretic framework for object recognition

CPM reception combining complexity reduction techniques for schemes on minimum Euclidian distance upper bound and MSK

On universal types

On hierarchical type covering

Nonasymptotic upper bounds on the probability of the /spl epsi/-atypical set for Markov chains

Analysis of Bin models with applications in coding theory

Maxwell's construction: the hidden bridge between maximum-likelihood and iterative decoding

Reliable channel regions for good codes transmitted over parallel channels

Coding for insertion/deletion error propagation effects associated with fixed length decoding windows

On lower bounds for the capacity of deletion channels

Insertion/deletion channels: reduced-state lower bounds on channel capacities

Extracting randomness from generalized symbol-fixing and Markov sources

Privacy amplification secure against an adversary with selectable knowledge

Smooth Renyi entropy and applications

A new algorithm for cryptanalysis of filtered LFSRs: the "probability-matching" algorithm

Reconstruction of a linear scrambler

Construction of good LDPC codes using dilation matrices

Methodologies for designing LDPC codes using protographs and circulants

Explicit construction of families of LDPC codes with no 4-cycles

Grouping-and-shifting designs for structured LDPC codes with large girth

Construction of quasicyclic LDPC codes based on the minimum weight codewords of Reed-Solomon codes

Limits to multiantenna capacity of spatially selective channels

The effect of line of sight on the asymptotic capacity of MIMO systems

Asymptotic capacity analysis of transmit antenna selection

On the capacity of vector antenna MIMO systems

Source-field wave-field concentration and dimension: towards spatial information content

Delay guarantee versus throughput in broadcast fading channels

Delay optimal multiaccess communication for general packet length distributions

Distributed scheduling in wireless data networks with service differentiation

Order optimal energy efficient transmission policies in the small delay regime

Adaptive signaling schemes for detection in wireless sensor networks

Information bounds and asymptotically optimal procedures for detecting changes in decentralized decision systems

A simple method to reach detection consensus in massively distributed sensor networks

Classification in sensor networks

Single user tracing superimposed codes

New results and applications of superimposed codes (and related combinatorial structures) to the design of efficient group testing procedures

Partition codes

Consta-dihedral codes and their transform domain characterization

Vandermonde-cocyclic codes and a suitable DFT

Iterative soft decision decoding of Reed Solomon codes based on adaptive parity check matrices

Sparse factor graph representations of Reed-Solomon and related codes

Limited-trial chase-like bounded-distance decoding

Soft-decision decoding of linear block codes using preprocessing

On the dynamics of continuous-time analog iterative decoding

On near-capacity coding systems for partial-response channels

Coded optimal partial response signaling

An analysis on optimal rates of BDB encoders for RLL and MTR systems

On the data-processing inequality in the mismatch case

Average transition density constraints for mitigating transition noise in magnetic recording

On the achievable rate for receiver cooperation in ad-hoc networks

Capacity of ad-hoc networks with node cooperation

Forwarding strategies for Gaussian parallel-relay networks

Diversity and multiplexing tradeoff bounds for cooperative diversity protocols

The outage behavior of coded cooperation

Low-density parity-check codes with rates very close to the capacity of the q-ary symmetric channel for large q

Low-density parity-check codes with fast decoding convergence speed

An efficient encoding method for LDPC codes based on cyclic shift

Structured LDPC codes over GF(2/sup m/) and companion matrix based decoding

On regular quasicyclic LDPC codes from binomials

Multiple access and time division: a new look

Window decoding for the multiaccess channel with generalized feedback

An approach to capacity analysis of coarsely coordinated low power multiple access systems

Asymptotic spectral efficiency of spatially correlated MIMO multiple-access channels with arbitrary signaling inputs for joint and separate decoding

Spectral efficiency of joint multiple cell-site processors for randomly spread DS-CDMA systems

Exponential diversity achieving spatio-temporal power allocation scheme for MIMO fading channels

A complete family of good quasiorthogonal STBC and a new family of orthogonal STBC for four transmit antennas

Space-time precoding with mean and covariance feedback: implications for wideband systems

Progressive union bound of space-time block codes and its saddlepoint approximation

High-SNR power offset in multiantenna communication

How good is an isotropic gaussian input on a MIMO Ricean channel?

Asymptotic capacity of beamforming with limited feedback

Optical MIMO transmission with multipulse PPM

Selection diversity in multiple antenna systems with matrix modulation

An analog turbo decoder for the UMTS standard

A scalable architecture of a structured LDPC decoder

Density evolution analysis of device mismatch in analog decoders

A repeat request strategy based on sliding window decoding of convolutional codes

Analysis of reliability-based incremental redundancy with convolutional codes

Estimating the optimal support and the rate of convergence to the Panter-Dite formula for a Laplacian source

Near rate-distortion bound performance of sparse matrix codes

Rapid near-optimal VQ design with a deterministic data net

Improved convergence rates in empirical vector quantizer design

Lagrangian global optimization of two-description scalar quantizers

Blind quality estimation for corrupted source signals based on a-posteriori probabilities

Asymptotic optimality of finite-memory detection

Algorithms for modeling distributions over large alphabets

Complexity-regularized multiresolution density estimation

Using universal coding approach to randomness testing

Closed form designs of complex orthogonal space-time block codes of rates (k+1)/(2k) for 2k_1 or 2k transmit antennas

Construction of quasi orthogonal STBC with minimum decoding complexity

Construction and analysis of a new 4 x 4 orthogonal space-time block code

The golden code: a 2 x 2 full-rate space-time code with non-vanishing determinants

Minimum distance bounds of irregular QC-LDPC codes and their applications

On the free distance of LDPC convolutional codes

A new upper bound on the minimum distance of turbo codes

An upper bound on the minimum distance of serially concatenated convolutional codes

Temporally correlated flat-fading channels with imperfect receiver CSI: a cutoff rate analysis

On the effect of channel estimation error with superimposed training upon information rates

The effect of CSI imperfection on the performance of SVD based adaptive modulation in MIMO systems

Performance analysis of optimum multiuser detector under phase mismatch

Coding performance of various type-I HARQ schemes with BICM

Matching air-interface with backbone: end-to-end resource allocation in hybrid networks

On the scalability of H-ARQ systems in wireless multicast

Quantum pseudo-telepathy and the kochen-specker theorem

Universal distortion-free entanglement concentration

On feedback and the classical capacity of a noisy quantum channel

Information capacity of bosonic channels

Probabilistic decoding of interleaved RS-codes on the q-ary symmetric channel

On polylogarithmic decoding complexity for reed-muller codes

Decoding of concatenated codes with interleaved outer codes

On the performance of integrated interleaving coding schemes

Approaching the slepian-wolf boundary using practical channel codes

Layered priority encoded transmission for video streaming to heterogeneous clients

A new source-splitting approach to the slepian-wolf problem

Lossy source coding under a maximum distortion constraint with decoder side-information

Capacity of the generalized PPM channel

Multipulse PPM on memoryless channels

Space diversity for the multimode optical fiber channel

Extended carrier-hopping prime codes for optical and wireless CDMA systems

Designs and full-rank STBCs from DFT domain description of cyclic codes

Performance bounds for space-time block codes with antenna selection

Four antenna space-time lattice constellations from division algebras

Trace-orthonormal full diversity cyclotomic linear dispersion codes

Filling-in some of the decoding gap between belief propagation (BP) and maximum a posteriori (MAP) for convolutional codes

Belief-propagation with information correction: improved near maximum-likelihood decoding of low-density parity-check codes

Soft-input soft-output decoding algorithm of linear block codes based on minimum distance search

On APP-decoding using BEAST

Markov processes asymptotically achieve the capacity of finite-state intersymbol interference channels

On the discreteness of the capacity-achieving probability measure of conditional gaussian channels

Simple tight bounds on capacity for the peak-limited discrete-time channel

Mutual information and MMSE in gaussian channels

Asymptotically optimal power allocation with MMSE receivers

Capacity region of power controlled fading CDMA: transmit strategies and convexity issues

Distributed power and admission control for time-varying wireless networks

A semi-algebraic approach to multiuser beamforming and power control

Remarks on Clifford codes

Universal non-destructive estimation of quantum relative entropy

On quantum MDS codes

Entropy measures and catalysis of bipartite quantum state transformations

A system of polynomials for the complex hamming spaces

Association schemes and metrics on a finite group

On the maximal rate of square quasi-orthogonal designs

Generalization and applications of McEliece's theorem

Communication and distributional complexity of joint probability mass functions

Progressive coding of information with progressively coded side information

On successive refinement for the Wyner-Ziv problem

On hierarchical joint source-channel coding

Optimal optical orthogonal codes with /spl lambda/ > 1

Multiple-wavelength optical orthogonal codes under prime-sequence permutations

Frequency hopping sequences with optimal partial autocorrelation property

A lower bound to the scaling behavior of sensor networks

Information theoretic upper bounds on the capacity of large extended ad-hoc wireless networks

Scaling laws in random heterogeneous networks

The transport capacity of wireless networks over fading channels

Designing good LDPC codes for markov-modulated channels

Decoding of linear codes with low-density generator matrix over finite-state binary markov channels

Analysis of LDPC decoding for correlated and uncorrelated block fading channels

Turbo-like codes for the block-fading channel

The zero-error capacity of compound channels

Optimal feedback schemes over unknown channels

Efficient variable length channel coding for unknown DMCs

Noncoherent eigenbeamforming for a wideband cellular uplink

Optimal pulses for ultra-wide band communication systems on gaussian and dense multi-path channels

Power spectra of UWB time-hopping modulated signals: a shot noise approach

Semicoherent PPM for wideband communications

Improved list decoding of generalized reed-solomon and alternant codes over rings

Reduced complexity interpolation for soft-decoding of reed-solomon codes

Divide-and-conquer interpolation for list decoding of reed-solomon codes

Polynomial matrix-chain interpolation in sudan-type reed-solomon decoders

Generalized bounds on the crest-factor distribution of OFDM signals with applications to code design

System capacity of wideband OFDM communications over fading channels without channel knowledge

Unequal Error Protected Image Transmission over Multilevel coded Wavelet Packet Multicarrier Modulation System

Bit loading algorithms for OFDM

Joint source-channel cooperation: diversity versus spectral efficiency

Source-channel diversity approaches for multimedia communication

Adaptive joint source/channel rate allocation policies for delay sensitive applications over fading channels

On the performance of parallel concatenated joint source-channel coding with variable-length codes

Cross-symbol codes

Two-dimensional burst-correcting codes

Fast decoding of rank-codes with rank errors and column erasures

On the capacity of AWGN relay channels with linear relaying functions

On the capacity of wireless erasure networks

On energy efficiency of relay transmissions

Diversity gains and clustering in wireless relaying

The impact of relaying on the capacity of broadcast channels

A new look at the error-correcting capabilities of convolutional codes

Codes with good slope for serially concatenated trellis coded modulation

Design of turbo codes using high rate nonsystematic convolutional encoders

Finite length serial concatenation of SPC codes with conv. codes

Diversity order analysis of training codes for MIMO block fading channels

Optimal constructions of space-time codes over multiple fading blocks

Partitioning techniques for design of multilevel codes for Rayleigh fading channels

Closed form capacity expressions for space time block codes over fading channels

Bounds on the performance of rotated lattice constellations

Channel coherence in the low SNR regime

Near-optimal signaling for wideband-fading channels

The capacity of spread-spectrum Rayleigh fading channels in the presence of channel uncertainty

The Gaussian interference channel at low SNR

Benefits of correlated MIMO schemes for wideband communication

Exponential error bounds for algebraic soft-decision decoding of Reed Solomon codes

Performance enhancements for algebraic soft decision decoding of Reed-Solomon codes

Adaptive and iterative soft-decision list decoding

List decoding of concatenated codes: improved performance estimates

On signals with very high peak-to-average power ratio

Combined block coded modulation and peak-to-average power ratio reduction in OFDM systems

On the PAPR of binary Reed-Muller OFDM codes

ICI self cancellation - Golay complementary Reed-Muller code scheme for OFDM systems

Crest-factor analysis of carrier interferometry MC-CDMA and OFDM systems

Frog-in-the-box index codes with maximum likelihood decoding for robust scalar quantization

Cell density functions and effective channel code rates for quantizers with uniform decoders and channel optimized encoders

Robust predictive quantization: a new analysis and optimization framework

First-order multiplexed source codes for error-resilient entropy coding

Source coding using a class of universal hash functions

Sum capacity of binary signatures that minimize the total squared correlation

Blind bandwidth-efficient schemes for CDMA on dispersive MIMO channels

An asymptotic analysis of band-limited DS/SSMA systems

A max-min fair approach to optimize the CDMA capacity region

Isometric multisignature multiuser MC-CDMA in frequency-selective fading

Throughput and delay in random wireless networks: 1-D mobility is just as good as 2-D

Throughput-delay trade-off in energy constrained wireless networks

Closing the gap in the capacity of random wireless networks

Throughput scaling in wireless networks with restricted mobility

EXIT functions for binary memoryless symmetric channels

Turbo codes and Shannon's condition for reliable communication

Bounds on information combining for the accumulator of repeat-accumulate codes without Gaussian assumption

Non-gaussian behaviour of extrinsic log-values

Feedback, queueing, and the reliability of the ideal Poisson channel above capacity

On the reliability exponent of the geometric server timing channel

On the random coding error exponents of the single-user and the multiple-access Gel'fand-Pinsker channels

Error exponent region for Gaussian multiple access channels

Reconstruction of permutations distorted by single reversal errors

On unequal error protection for information symbols via active distances

Optimization of LDPC codes for UEP channels

Unequal error protection using low-density parity-check codes

Quasiperfect codes with small distance

New good linear codes by special puncturings

Linear codes with complementary duals meet the Gilbert-Varshamov bound

Nonintersecting subspaces based on finite alphabets

Blind recognition of punctured convolutional codes

Analysis of convolutional codes on the erasure channel

On convolutional codes and sphere packing bounds

Convolutional codes with cyclic structure

Efficient algorithms and minimax bounds for zero-delay lossy source coding

Minimum description length vs. maximum likelihood in lossy data compression

The empirical distribution of rate-constrained source codes

Coding unstable scalar Markov processes into two streams

Consistency in a model for distributed learning with specialists

Entropic graphs for intrinsic dimension estimation in manifold learning

Adaptive regression estimation with multilayer feedforward neural networks

PAC learning for Markov decision processes and dynamic games

Power bandwidth trade-off for sensory and ad-hoc wireless networks

The effect of interference on the capacity of multihop wireless networks

Capacity scaling in wireless ad-hoc networks with P/sub e/

Scaling laws for correlated data gathering

A simple method of approximating the error floor of turbo codes with S-type permutors

Tight bounds for LDPC codes under MAP decoding

Approximate algorithms for computing the minimum distance of low-density parity-check codes

Estimating LDPC codeword error rates via importance sampling

Statistical mechanical evaluation of error exponents for lossy data compression

On the computation of the joint source-channel error exponent for memoryless system

Error exponents for channel coding and signal constellation design

Achievable rates and decoding error probability for parallel channels with dependent noise and restricted number of active users

Low complexity code design for the 2-user Gaussian multiple access channel

Distributed decoding in a cellular multiple-access channel

On two upper bounds on the size of t-EC-AUED codes

Probability of undetected error for a class of unidirectional error detecting codes

Bounds on distance distributions in codes of known size

Bounds on codes derived by counting components in Varshamov graphs

A mass formula for /spl Zopf//sub 4/ cyclic codes of length 2/sup e/

Weight enumerators of duadic and quadratic residue codes

Forward-only iterative decoding of convolutional self-orthogonal codes

A Simple parallel dual code decoding algorithm for convolutional codes with high throughput and low latency

Reduced complexity decoding strategies for LDPC convolutional codes

Reduced-complexity iterative decoding using a variable-size trellis structure

Error-rate dependence of nonbandlimited signals with finite rate of innovation

Good trellis source codes at fractional rates

Performance of low rate entropy-constrained scalar quantizers

Optimal quantization in neural coding

Hyper-bent functions and cyclic codes

Cubic Boolean functions with highest resiliency

On some properties of symmetric Boolean functions

New p-ary bent sequences

Asymptotically tight bound on SER of MIMO zero-forcing receivers with correlated fading

On estimating the symbol APP in MIMO systems

A study of low-complexity and low-latency MIMO detectors

Optimal estimator-detector receivers for space-time block coding

Accumulate repeat accumulate codes

Low-density mirror-concatenated codes: a generalization of irregular repeat-and- accumulate codes

Enhancement of turbo codes using cyclic redundancy check with interleaver optimisation

Variable-rate turbo bit-interleaved coded modulation

Asymptotic design and analysis of linear detectors for CDMA systems

The cross-entropy method for blind multiuser detection

On sequence design for a synchronous CDMA channel

Differential bandwidth and equivalent bandwidth for overloaded multiuser communications

Binary shaping for low-duty-cycle communications

Serially concatenated continuous phase modulation with ring convolutional codes

Embedded turbo coding in pattern position modulation for ultra wideband radio systems

Design of woven coded CPFSK via hierarchical code structure

Decentralized estimation in an inhomogeneous environment

Adaptive sampling for wireless sensor networks

On diffusive source localization using dumb sensors

Virtual radar approach to event localization in sensor networks

Statistical approach to ML decoding of linear block codes on symmetric channels

Minimum basis search algorithm for nearly maximum likelihood decoding of block codes

On the thinnest coverings of ellipsoids

Miscorrection probability beyond the minimum distance

A generalization of MDS codes

MDS self-dual codes

On q-ary Grey-Rankin bound and codes meeting this bound

Matrix characterization of near-MDS codes over Z/sub m/ and Abelian groups

Application of maximal ratio combining for iterative multiuser decoding

Multiuser detection based on reduced complexity probabilistic data association

A generalized probabilistic data association multiuser detector

Improving the performance of linear parallel interference cancellation for CDMA using a method of the statistical mechanics

Writing on many pieces of dirty paper at once: the binary case

Multiple user writing on dirty paper

Random coding bound of information hiding E-capacity

A close-to-capacity dirty paper coding scheme

Product lattice codes

MMSE-GDFE lattice decoding for solving under-determined linear systems with integer unknowns

Channel dependent tree pruning for the sphere decoder

Derivation on bit error probability of coded QAM using integer codes

Duality bounds on the cut-off rate with applications to Ricean fading

The uniqueness of the capacity-achieving distribution over noncoherent flat-fading channels

Spectral efficiency of peak power limited Rician block-fading channels

Capacity of pilot-aided MIMO communication systems

On the vector decomposition problem for m-torsion points on an elliptic curve

On the zeta functions of two towers of function fields

On the secondary constructions of resilient functions

Low-weight left-to-right binary signed-digit representation of N integers

Arithmetic homophonic coding with dummy symbols

Detection and localization of an anomaly from noisy projections

Receiver design for rapidly time-varying channels

Joint multiple target tracking and classification in collaborative sensor networks

Rigid body target modeling for tracking and identification

List sequence turbo decoding techniques

Finding a list of best paths in a trellis

8-PSK turbo equalization with the list-sequential (LISS) algorithm

Waveform synthesis using list-decoding of codes over the real alphabet

Finite-state rate-distortion for individual sequences

Signal sampling and recovery under long-memory errors

Causal coding of individual sequences and the Lempel-Ziv differential entropy

Applicability of the sample path method of ergodic processes to individual sequences

Memoryless individual sequences

Filter bank frame-expansion with erasures-a para-pseudo inverse based reconstruction

Factorization of two-channel 2D paraunitary filter banks over fields of characteristic two

Surflets: a sparse representation for multidimensional functions containing smooth discontinuities

IEEE International Symposium on Information Theory, 2003. Proceedings.

Proceedings IEEE International Symposium on Information Theory,

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)

2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)

Proceedings of IEEE International Symposium on Information Theory

Proceedings of 1995 IEEE International Symposium on Information Theory

Proceedings of 1994 IEEE International Symposium on Information Theory

Proceedings. IEEE International Symposium on Information Theory

Proceedings. 1991 IEEE International Symposium on Information Theory

1988 IEEE International Symposium on Information Theory.

Structured LDPC codes over GF(2/sup m/) and companion matrix based decoding

Content Provider	IEEE Xplore Digital Library
Author	Kumar, V. Milenkovic, O. Vasic, B.
Copyright Year	2004
Description	Author affiliation: Dept. of Electr. & Comput. Eng., Colorado Univ., Boulder, CO, USA (Kumar, V.; Milenkovic, O.)
Abstract	It is well known that random-like low-density parity-check (LDPC) codes over the extension fields GF(2/sup m/) of GF(2), for m>1, tend to outperform their binary counterparts of comparable length and rate. At the same time, structured LDPC codes offer the advantage of reduced implementation and storage complexity, so that it is of interest to investigate mathematical design methods for codes on graphs over fields of large order. We propose a new class of combinatorially developed codes obtained by properly combining Reed-Solomon (RS) type parity-check matrices and sparse parity-check matrices based on permutation matrices. The proposed codes have large girth and minimum distance. In order to further reduce the decoding complexity of the proposed scheme, we introduce a new decoding algorithm based on matrix representations of the underlying field, which trades performance for complexity. The particular field representation described in this abstract is based on a power basis generated by a companion matrix of a primitive polynomial of the field GF(2/sup m/). It is observed that the choice of the primitive polynomial influences the cycle distribution of the code graph.
Sponsorship	IEEE Information Theory Soc
File Size	222871
File Format	PDF
ISBN	0780382803
DOI	10.1109/ISIT.2004.1365313
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2004-06-27
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Parity check codes Binary codes Iterative decoding Polynomials Bit error rate Code standards Iterative algorithms Message passing Algorithm design and analysis Turbo codes
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in