A lower bound on achievable rates by polar codes with mismatch polar decoding.
Mine AlsanPublished in: ITW (2013)
Keyphrases
- lower bound
- rotation invariant
- upper bound
- frequency domain
- fourier transform
- fourier analysis
- decoding algorithm
- branch and bound algorithm
- polar coordinates
- error correcting
- lower and upper bounds
- error correction
- np hard
- objective function
- low density parity check
- cartesian coordinates
- parity check
- worst case
- scheduling problem
- feature vectors
- optimal solution