2000 character limit reached
Fast Sequential Decoding of Polar Codes
Published 20 Mar 2017 in cs.IT and math.IT | (1703.06592v2)
Abstract: A new score function is proposed for stack decoding of polar codes, which enables one to accurately compare paths of different lengths. The proposed score function includes bias, which reflects the average behaviour of the correct path. This enables significant complexity reduction with respect to the original stack algorithm at the expense of a negligible performance loss.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.