Recursive constructions and their maximum likelihood decoding
classification
💻 cs.IT
math.IT
keywords
decodingcodesrecursivecomplexityconsiderconstructionsdesignedfeasible
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.