Work

Lower Bounds on Stopping Distance of Linear Codes and Their Applications

Year: 2005

Type: conference-paper

Abstract: One of the most important open problems in the communication society is to determine the performance of iterative message passing algorithms over loopy graphs.Some recent work addresses this problem for loopy Tanner graphs by introducing the concepts of stopping distance and stopping redundancy.By analyzing the eigenvalues and eigenvectors of the normalized incidence matrix representing a Tanner graph, we derive lower bounds on its stopping distance.Using these lower bounds, an upper bound on stopping redundancy of the difference-set codes is derived as well.

Source: Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)

Authors: Zhu, Mingrui, Chugg, Keith M.

Language: English

Topic: Coding theory and cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W7220776296

FWCI:

Cites:

Cited by:

Related to: 10