Analytical Solution of Covariance Evolution for Regular LDPC Codes

Simple item page
dc.creatorNozaki, Takayuki
dc.creatorKasai, Kenta
dc.creatorSakaniwa, Kohichi
dc.date2009-01-19
dc.date.accessioned2026-07-07T12:31:36Z
dc.date.available2026-07-07T12:31:36Z
dc.descriptionThe covariance evolution is a system of differential equations with respect to the covariance of the number of edges connecting to the nodes of each residual degree. Solving the covariance evolution, we can derive distributions of the number of check nodes of residual degree 1, which helps us to estimate the block error probability for finite-length LDPC code. Amraoui et al.\ resorted to numerical computations to solve the covariance evolution. In this paper, we give the analytical solution of the covariance evolution.
dc.description5 pages, 3 figures, submitted to ISIT2009
dc.identifierhttps://arxiv.org/abs/0901.2838
dc.identifierhttp://arxiv.org/abs/0901.2838
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/216501
dc.subjectInformation Theory
dc.titleAnalytical Solution of Covariance Evolution for Regular LDPC Codes
dc.typetext

Files

Collections

arXiv