Reply to post: Re: How does this compare to LDPC?

Erasure coding startup springs forth from Silicon Fjord

Ur0.v1^EIDJO

Re: How does this compare to LDPC?

LDPC detects errors within a block due to noise in the channel. It helps to have an upper estimate of the actual noise.

Erasure codes recover missing blocks generally due to sector errors in storage components.They are measured by the number of failures they can tolerate, storage overhead and reconstruction cost/speed. There are trade offs between the three but generally you choose your mean time to data loss which gives you the number of failures to tolerate and then you trade off storage overhead against reconstruction time.

Storage overhead of 1.2 would appear to push up reconstruction cost and decrease MTTDL but it's a valid point in the 3D trade off space.

Both LPDC and erasure codes (at least pyramid ones) can be described with Tanner graphs.

POST COMMENT House rules

Not a member of The Register? Create a new account here.

  • Enter your comment

  • Add an icon

Anonymous cowards cannot choose their icon