On asymptotic ensemble weight enumerators of multi-edge type codes

Authors:
Chung-Li Wang;Shu Lin;Marc Fossorier
Affiliations:
Department of Electrical and Computer Engineering, University of California, Davis, Davis, CA;Department of Electrical and Computer Engineering, University of California, Davis, Davis, CA;ETIS ENSEA, UCP, CNRS UMR, Pontoise, France
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 6
Cited 0

Error Control Coding, Second Edition

Error Control Coding, Second Edition
Convex Optimization

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

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
Weight distributions of multi-edge type LDPC codes

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Weight Distribution of Low-Density Parity-Check Codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we investigate the asymptotic ensemble weight enumerators of multi-edge type codes whose component codes are arbitrary block codes. Two forms of asymptotic growth rate of codewords, corresponding to the primal and dual problems, are obtained. Furthermore, for the codewords of small linear-sized weights, we develop a simplification method to restrict the search space of the primal problem and study the optimality conditions of the dual problem, giving a first-order approximation of the growth rate and a condition of exponentially few small weight codewords.