Improved Expression for Rank Distribution of Sparse Random Linear Network Coding

Characterization of the rank distribution of a sparse random matrix over a finite field can be decomposed into two subproblems. The first subproblem is the characterization of the probability <inline-formula> <tex-math notation="LaTeX">p(i,n) </tex-math></inline-formul...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE communications letters Ročník 25; číslo 5; s. 1472 - 1476
Hlavní autori:	Chen, Wenlin, Lu, Fang, Dong, Yan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.05.2021 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Decoding Decomposition Eigenvalues and eigenfunctions Exact solutions Fields (mathematics) Markov chains Markov processes Matrices (mathematics) Matrix decomposition Network coding rank distribution Receivers Sparse matrices Sparse random linear network coding
ISSN:	1089-7798, 1558-2558
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!