Talk:Erasure code

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Telecommunications (Rated Start-class)
WikiProject icon This article is within the scope of WikiProject Telecommunications, a collaborative effort to improve the coverage of Telecommunications on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
Start-Class article Start  This article has been rated as Start-Class on the quality scale.
 ???  This article has not yet received a rating on the importance scale.

Suggested merger[edit]

The Optimal_erasure_codes_with_arbitrary_parameters contains a great example + easier to follow introduction that I think really belong in the primary article. Derek farn 19:18, 27 May 2007 (UTC)

Appears your suggestion was accepted? —Preceding unsigned comment added by (talk) 12:20, 1 June 2009 (UTC)

FFT style oversampling[edit]

It looks possible to do oversampling during the encoding stage with an FFT style algorithm, which will be faster than the algorithm currently described. Is this possible ? It will only have a benefit when sending large amounts of information over a reasonably noisy channel and then the benefit would be relatively small (compared to, say, compressing the data better). Is it practical ? -- Nic Roets (talk) 13:11, 10 June 2009 (UTC)

if I'm right, this kind of approach have been studied for Reed Solomon codes, but I don't have any reference ... Cunchem (talk) 17:40, 10 June 2009 (UTC)

Tie-in to Shamir's Secret Sharing?[edit]

It seems to me that Shamir's Secret Sharing is an example of an erasure code, with additional security properties not necessarily shared by other erasure codes. It might be useful to have cross-references back and forth, and ideally also a discussion of how Shamir's algorithm is different (or has additional properties) vs. other erasure codes. Paul Koning (talk) 18:24, 31 August 2011 (UTC)

Good point, though I'd say it is actually an application of an optimal erasure code. Cross references could be useful, I agree. If you would like to tackle it feel free to go ahead. Nageh (talk) 11:59, 1 September 2011 (UTC)
Shamir's code has the property that you have zero information until you have the required number of pieces (a "threshold code"). Is that true for other erasure codes? Some of the applicable math is well over my head, but I get the impression that other erasure codes are not necessarily threshold codes. Paul Koning (talk) 21:04, 16 September 2011 (UTC)
It is true for optimal erasure codes. You can easily prove that using information-theoretic arguments and/or via contradiction. Nageh (talk) 23:58, 16 September 2011 (UTC)