Papers
Topics
Authors
Recent
Search
2000 character limit reached

Performance of the Bounded Distance Decoder on the AWGN Channel

Published 24 Jul 2012 in cs.IT and math.IT | (1207.5850v1)

Abstract: In contrast to a maximum-likelihood decoder, it is often desirable to use an incomplete decoder that can detect its decoding errors with high probability. One common choice is the bounded distance decoder. Bounds are derived for the total word error rate, Pw, and the undetected error rate, Pu. Excellent agreement is found with simulation results for a small code, and the bounds are shown to be tractable for a larger code.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. Kenneth Andrews 
  2. Sam Dolinar 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up