Lesson plan

Triangular network coding

In coding theory, triangular network coding (TNC) is a non-linear network coding based packet coding scheme introduced by . Previously, packet coding for network coding was done using linear network coding (LNC). The drawback of LNC over large finite field is that it resulted in high encoding and decoding computational complexity. While linear encoding and decoding over GF(2) alleviates the concern of high computational complexity, coding over GF(2) comes at the tradeoff cost of degrading throughput performance. The main contribution of triangular network coding is to reduce the worst-case decoding computational complexity of O(n^3) to O(n^2) (where n is the total number of data packets being encoded in a coded packet) without degrading the throughput performance, with code rate comparable to that of optimal coding schemes. Triangular code has also been proposed as Fountain code to achieve near-optimal performance with encoding and decoding computational complexity of O(n\log n) . It has been further shown that triangular based fountain code can even outperform optimized Luby transform code.

Back to article

Article summary

In coding theory, triangular network coding (TNC) is a non-linear network coding based packet coding scheme introduced by . Previously, packet coding for network coding was done using linear network coding (LNC). The drawback of LNC over large finite field is that it resulted in high encoding and decoding computational complexity. While linear encoding and decoding over GF(2) alleviates the concern of high computational complexity, coding over GF(2) comes at the tradeoff cost of degrading throughput performance. The main contribution of triangular network coding is to reduce the worst-case decoding computational complexity of O(n^3) to O(n^2) (where n is the total number of data packets being encoded in a coded packet) without degrading the throughput performance, with code rate comparable to that of optimal coding schemes. Triangular code has also been proposed as Fountain code to achieve near-optimal performance with encoding and decoding computational complexity of O(n\log n) . It has been further shown that triangular based fountain code can even outperform optimized Luby transform code.

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.