You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
As the codes are extremely short (<16 bits) we can simply implement a brute-force MAP decoder by checking all possible codeword candidates.
For example if k=8 we have 2^8=256 codeword candidates that need to be checked and the decoder selects the one with the smallest distance. This works for Polar and for the random code.
Is this BCJR decoding?
The text was updated successfully, but these errors were encountered: