On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices

Authors:
A. Sridharan;M. Lentmaier;D. V. Truhachev;D. J. Costello, Jr.;K. Sh. Zigangirov
Affiliations:
University of Notre Dame, Indiana, USA;German Aerospace Center (DLR), Institute of Communications and Navigation, Wessling;University of Alberta, Edmonton, Canada;University of Notre Dame, Indiana, USA;Aff1 Aff2
Venue:
Problems of Information Transmission
Year:
2005

Citing 2
Cited 5

Fundamentals of Convolutional Coding

Fundamentals of Convolutional Coding
LDPC block and convolutional codes based on circulant matrices

IEEE Transactions on Information Theory

On the error-correcting capability of LDPC codes

Problems of Information Transmission
On asymptotic ensemble weight enumerators of LDPC-like codes

IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
On asymptotic ensemble weight enumerators of multi-edge type codes

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Distance bounds for periodically time-varying and tail-biting LDPC convolutional codes

IEEE Transactions on Information Theory
Iterative decoding threshold analysis for LDPC convolutional codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.12

Visualization

Abstract

Eigenvalue densities of complex noncentral Wishart matrices are investigated to study an open problem in information theory. Specifically, the largest, smallest, and joint eigenvalue densities of complex noncentral Wishart matrices are derived. These ...