Content deleted Content added
m Dating maintenance tags: {{When}} |
m →Code-rate and the tradeoff between reliability and data rate: HTTP → HTTPS for IEEE Xplore, replaced: http://ieeexplore.ieee.org/abstract/ → https://ieeexplore.ieee.org/abstract/ |
||
Line 95:
One interesting question is the following: how efficient in terms of information transfer can be an ECC that has a negligible decoding error rate? This question was answered by Claude Shannon with his second theorem, which says that the channel capacity is the maximum bit rate achievable by any ECC whose error rate tends to zero:<ref name="shannon paper">C. E. Shannon: ''A mathematical theory of communication.'' [[Bell System Technical Journal]], vol. 27, pp. 379–423 and 623–656, July and October 1948</ref> His proof relies on Gaussian random coding, which is not suitable of real-world applications. This upper bound given by Shannon's work set up a long journey in designing ECCs that can go close to the ultimate performance boundary. Various codes today can attain almost the Shannon limit. However, capacity achieving ECCs are usually extremely complex to implement.
The most popular ECCs have a trade-off between performance and computational complexity. Usually, their parameters give a range of possible code rates, which can be optimized depending on the scenario. Usually, this optimization is done in order to achieve a low decoding error probability while minimizing the impact to the data rate. Another criterion for optimizing the code rate is to balance low error rate and retransmissions number in order to the energy cost of the communication.<ref>{{Cite conference |title=Optimizing the code rate for achieving energy-efficient wireless communications |first1=Fernando |last1=Rosas |first2=Glauber |last2=Brante |first3=Richard Demo |last3=Souza |first4=Christian |last4=Oberli |url=
==Concatenated ECC codes for improved performance==
| |||