Papers
Topics
Authors
Recent
Search
2000 character limit reached

Recursive constructions and their maximum likelihood decoding

Published 14 Mar 2017 in cs.IT and math.IT | (1703.05302v1)

Abstract: We consider recursive decoding techniques for RM codes, their subcodes, and newly designed codes. For moderate lengths up to 512, we obtain near-optimum decoding with feasible complexity.

Citations (7)
View on Semantic Scholar

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. Ilya Dumer 
  2. Kirill Shabunov 

Collections

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

Sign Up