| Full text | |
| Author(s): |
Total Authors: 3
|
| Affiliation: | [1] Univ Estadual Campinas, Inst Matemat Estat & Comp Cient, Campinas, SP - Brazil
[2] Univ Alacant, Dept Matemat, Alacant - Spain
[3] Inst Nacl Matemat Pura & Aplicada, Rio De Janeiro - Brazil
Total Affiliations: 3
|
| Document type: | Journal article |
| Source: | REVISTA DE LA REAL ACADEMIA DE CIENCIAS EXACTAS FISICAS Y NATURALES SERIE A-MATEMATICAS; v. 113, n. 4, p. 3751-3765, OCT 2019. |
| Web of Science Citations: | 0 |
| Abstract | |
The SPC product code is a very popular error correction code with four as its minimum distance. Over the erasure channel, it is supposed to correct up to three erasures. However, this code can correct a higher number of erasures under certain conditions. A codeword of the SPC product code can be represented either by an erasure pattern or by a bipartite graph, where the erasures are represented by an edge. When the erasure contains erasures that cannot be corrected, the corresponding graph contains cycles. In this work we determine the number of strict uncorrectable erasure patterns (bipartite graphs with cycles) for a given size with a fixed number of erasures (edges). Since a bipartite graph can be unequivocally represented by its biadjacency matrix, it is enough to determine the number of non-zero binary matrices whose row and column sum vectors are different from one. At the same time, the number of matrices with prescribed row and column sum vectors can be evaluated in terms of the Kostka numbers associated with Young tableaux. (AU) | |
| FAPESP's process: | 13/25977-7 - Security and reliability of Information: theory and practice |
| Grantee: | Marcelo Firer |
| Support Opportunities: | Research Projects - Thematic Grants |