Jump to content

Talk:Systematic code

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Oli Filth (talk | contribs) at 16:25, 10 July 2008 (Reverted edits by 147.161.1.25 (talk) to last version by Oli Filth). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Comparison

I've removed the stuff comparing typical uses of systematic vs. non-systematic, for the following reasons:

  • The terms "systematic" and "non-systematic" are typically used to describe channel coding, not source coding. Therefore, discussions of "redundancy within the original bit stream" are irrelevant.
  • Any non-systematic block or convolutional code can be transformed into an equivalent systematic code, that performs identically. Therefore, the following claims are untrue:
    • "They are appropriate for noisy channels (e.g. wireless communication)." In fact, systematic codes are almost always used in practice, as they are far easier to generate and decode.
    • "Systematic codes are typically used when the probability of loss or damage is low or transmission latency is an issue." This implies that they are not generally used when the probability of loss is high.
    • "Systematic codes have a lower bound on the size of the encoded output: the size of the original message." This of course applies to non-systematic codes as well.

Oli Filth 22:54, 22 February 2007 (UTC)[reply]