Critical Point for Maximum Likelihood Decoding of Linear Block Codes

Details Critical Point for Maximum Likelihood Decoding of Linear Block Codes Critical Point for Maximum Likelihood Decoding of Linear Block Codes

2005-04-10

arxiv.org/abs/cs/0504032v1

Computer Science

Information Theory

to appear IEEE Communications Letters

Scientific paper

In this letter, the SNR value at which the error performance curve of a soft
decision maximum likelihood decoder reaches the slope corresponding to the code
minimum distance is determined for a random code. Based on this value, referred
to as the critical point, new insight about soft bounded distance decoding of
random-like codes (and particularly Reed-Solomon codes) is provided.

Affiliated with

Also associated with

No associations

Rating

Critical Point for Maximum Likelihood Decoding of Linear Block 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 Critical Point for Maximum Likelihood Decoding of Linear Block Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Critical Point for Maximum Likelihood Decoding of Linear Block Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-64058