Evaluation of the rank of balanced random sparse matrices over residual fields used for erasure codes
Abstract: We consider random sparse n × m matrices over Finite Fields F[2k], F[p] (p prime), F[pk] (p prime), used for linear erasure codes. The matrices are balanced or are derived from balanced matrices via the erasure of rows. The entries are non-zero uniformly distributed values. The target of the thesis is to analyze and simulate the rank of the matrices and the recoverability depending on the number of entries, the size of the matrix, and the field size p^k. First, we analyze the rank of these matrices over varying finite field size. The analysis shows that the full rank probability increases with increasing field size, and converges to 1 − 1/q, for large field sizes q. Then we try to solve the rank problem analytically, coming up with a rank probability formula for small matrices. Lastly, the analytical approach provides the foundation for an automated approach, i.e., an algorithm, to solve the problem. The algorithm is the main result of this work. It is based on conclusions from the analytical analysis and calculations
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Universität Freiburg, Masterarbeit, 2021
- Schlagwort
-
Auslöschungskanal
Matrizenrechnung
Galois-Feld
Zufallsgraph
- Ereignis
-
Veröffentlichung
- (wo)
-
Freiburg
- (wer)
-
Universität
- (wann)
-
2021
- Urheber
- Beteiligte Personen und Organisationen
- DOI
-
10.6094/UNIFR/176176
- URN
-
urn:nbn:de:bsz:25-freidok-1761762
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:24 MESZ
Datenpartner
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
Entstanden
- 2021
Ähnliche Objekte (12)
The rank of sparse random matrices
The rank of sparse random matrices
Nonparametric Analysis of Balanced Incomplete Block Rank Data
Sparse reduced-rank regression for integrating omics data
Projection Methods in Sparse and Low Rank Feasibility
On the rank of combinatorial sparse random matrices
The full rank condition for sparse random matrices
Sparse reduced-rank regression for simultaneous rank and variable selection via manifold optimization
Correction: Sparse reduced-rank regression for simultaneous rank and variable selection via manifold optimization
Balanced Truncation Model Reduction of Large and Sparse Generalized Linear Systems
Biological direct-shortcut deep residual learning for sparse visual processing
Riemannian thresholding methods for row-sparse and low-rank matrix recovery
The rank of sparse random matrices
The rank of sparse random matrices
Nonparametric Analysis of Balanced Incomplete Block Rank Data
Sparse reduced-rank regression for integrating omics data
Projection Methods in Sparse and Low Rank Feasibility
On the rank of combinatorial sparse random matrices
The full rank condition for sparse random matrices
Sparse reduced-rank regression for simultaneous rank and variable selection via manifold optimization
Correction: Sparse reduced-rank regression for simultaneous rank and variable selection via manifold optimization
Balanced Truncation Model Reduction of Large and Sparse Generalized Linear Systems
Biological direct-shortcut deep residual learning for sparse visual processing
Riemannian thresholding methods for row-sparse and low-rank matrix recovery
The rank of sparse random matrices
The rank of sparse random matrices
Nonparametric Analysis of Balanced Incomplete Block Rank Data
Sparse reduced-rank regression for integrating omics data
Projection Methods in Sparse and Low Rank Feasibility
On the rank of combinatorial sparse random matrices
The full rank condition for sparse random matrices
Sparse reduced-rank regression for simultaneous rank and variable selection via manifold optimization
Correction: Sparse reduced-rank regression for simultaneous rank and variable selection via manifold optimization
Balanced Truncation Model Reduction of Large and Sparse Generalized Linear Systems
Biological direct-shortcut deep residual learning for sparse visual processing