科研之友
微信
新浪微博
Facebook
分享链接
摘要
Product codes can be used to correct errors or recover erasures. In this work we consider the simplest form of a product code, this is, the single parity check (SPC) product code. This code has a minimum distance of four and is thus guaranteed to recover all single, double, and triple erasure patterns. The code is actually capable of recovering a higher number of erasure patterns. We count the number of uncorrectable erasure patterns of size n x n with t erasures, for t = 8, 2n-3, 2n-2 and 2n-1, using the relation between erasure patterns and bipartite graphs.
- 出版日期2016-2
