New Geometrical Spectra of Linear Codes with Applications to Performance Analysis

Details New Geometrical Spectra of Linear Codes with Applications to Performance Analysis New Geometrical Spectra of Linear Codes with Applications to Performance Analysis

2012-02-03

arxiv.org/abs/1202.0621v1

Computer Science

Information Theory

Scientific paper

In this paper, new enumerating functions for linear codes are defined, including the triangle enumerating function and the tetrahedron enumerating function, both of which can be computed using a trellis-based algorithm over polynomial rings. The computational complexity is dominated by the complexity of the trellis. In addition, we show that these new enumerating functions can be used to improve existing performance bounds on the maximum likelihood decoding.

Affiliated with

Also associated with

No associations

Rating

New Geometrical Spectra of Linear Codes with Applications to Performance Analysis 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 New Geometrical Spectra of Linear Codes with Applications to Performance Analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Geometrical Spectra of Linear Codes with Applications to Performance Analysis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-4227