Construction, decoding and implementation of F_q linear codes. Performanca of SPC ...
Superregular matrices, product codes and cryptographic sequences
| Full text | |
| Author(s): |
Cardell, Sara D.
;
Climent, Joan-Josep
Total Authors: 2
|
| Document type: | Journal article |
| Source: | Advances in Mathematics of Communications; v. 10, n. 1, p. 18-pg., 2016-02-01. |
| Abstract | |
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. (AU) | |
| FAPESP's process: | 15/07246-0 - Construction, decoding and implementation of F_q linear codes. Performanca of SPC product codes and cryptanalysis of the shrinking generators. |
| Grantee: | Sara Díaz Cardell |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |