Unique and Minimum Distance Decoding of Linear Codes with Reduced Complexity

Details Unique and Minimum Distance Decoding of Linear Codes with Reduced Complexity Unique and Minimum Distance Decoding of Linear Codes with Reduced Complexity

2010-03-24

arxiv.org/abs/1003.4627v1

Computer Science

Information Theory

Scientific paper

We show that for (systematic) linear codes the time complexity of unique
decoding is O(n^{2}q^{nRH(delta/2/R)}) and the time complexity of minimum
distance decoding is O(n^{2}q^{nRH(delta/R)}). The proposed algorithm inspects
all error patterns in the information set of the received message of weight
less than d/2 or d, respectively.

Affiliated with

Also associated with

No associations

Rating

Unique and Minimum Distance Decoding of Linear Codes with Reduced Complexity 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 Unique and Minimum Distance Decoding of Linear Codes with Reduced Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unique and Minimum Distance Decoding of Linear Codes with Reduced Complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-57089