Jump to content

Talk:Raptor 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 10:00, 13 May 2009 (Rateless?). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Rateless?

Hi,

In this edit, the edit summary says "Raptor codes are rateless". Now, I admit I've only skimmed the journal paper, but how can a code be rateless? There are a number of symbols in, and a larger number out. The processing time must be proportional (at least) to the number of input symbols; surely the standard way of stating this is "encoding takes O(k) time"! Much in the same way that we don't state that the FFT runs in O(log n) time per input sample, but that it runs in O(n log n) time... Oli Filth(talk|contribs) 10:00, 13 May 2009 (UTC)[reply]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Raptor_code&oldid=289643726"