Talk:Multidimensional parity-check code

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

SISO decoder

I would love to add a section on soft-in soft-out decoders but I feel I'm just not up to it. just-emery (talk) 19:52, 1 June 2009 (UTC)[reply]

References

I knew when I wrote this that there wouldn't be many external references. The lack of websites talking about multidimensional parity was why I felt such an article needed to be written in the first place. But I'm not even finding much in google books or google scholar and what I do find I dont have access to. Here is a list of links. maybe someone with access can get a good list of references from them.

   * http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1286763
   * http://portal.acm.org/citation.cfm?id=321062.321067
   * http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=4380799

just-emery (talk) 22:04, 1 June 2009 (UTC)[reply]

We definitely need a reference for the error-correcting capability. Incidentally, I can't access these either, although the one at ACM does list the references. From the abstract, I can't see how the third paper you linked to above is relevant! Oli Filth^{(talk|contribs)} 20:14, 2 June 2009 (UTC)[reply]

The third one is here. Oli Filth^{(talk|contribs)} 20:21, 2 June 2009 (UTC)[reply]

An old textbook in a university library sounds like the best bet for finding a reference. just-emery (talk) 21:57, 2 June 2009 (UTC)[reply]

Error-correcting capability

After some thought, I now agree that the error-correcting capability is n/2. The "formal" reason is that the Hamming weight of each possible codeword is (n + 1), and it's a linear code, so this is also the minimum distance d_min . The error-correcting capability of a code is floor((d_min - 1) / 2), so in this case it is indeed n/2.

However, this is all original research on my part! We still probably need a proper source. Oli Filth^{(talk|contribs)} 22:13, 2 June 2009 (UTC)[reply]