Spectral Graph Analysis of Quasi-Cyclic Codes

Details Spectral Graph Analysis of Quasi-Cyclic Codes Spectral Graph Analysis of Quasi-Cyclic Codes

2009-08-14

arxiv.org/abs/0908.1966v2

Computer Science

Information Theory

5 pages. Proc. IEEE Globecom 2009, Hawaii, USA, November 30 - December 4, 2009

Scientific paper

In this paper we analyze the bound on the additive white Gaussian noise channel (AWGNC) pseudo-weight of a (c,d)-regular linear block code based on the two largest eigenvalues of H^T H. In particular, we analyze (c,d)-regular quasi-cyclic (QC) codes of length rL described by J x L block parity-check matrices with circulant block entries of size r x r. We proceed by showing how the problem of computing the eigenvalues of the rL x rL matrix H^T H can be reduced to the problem of computing eigenvalues for r matrices of size L x L. We also give a necessary condition for the bound to be attained for a circulant matrix H and show a few classes of cyclic codes satisfying this criterion.

Affiliated with

Also associated with

No associations

Rating

Spectral Graph Analysis of Quasi-Cyclic Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Spectral Graph Analysis of Quasi-Cyclic Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spectral Graph Analysis of Quasi-Cyclic Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-271935