Improving the probability of complete decoding of random code by trading-off computational complexity.
Zan-Kai ChongBok-Min GoiHiroyuki OhsakiCheng-Kuan Bryan NgHong-Tat EwePublished in: IET Commun. (2015)
Keyphrases
- computational complexity
- error correcting
- error control
- high computational complexity
- reed solomon
- probability distribution
- np hard
- source code
- rate distortion
- central limit theorem
- program code
- error detection
- np complete
- computational cost
- special case
- real time
- computational efficiency
- memory requirements
- video coding
- motion vectors
- decoding algorithm
- bit rate
- bit errors
- ldpc codes
- data sets