Random matrices and codes for the erasure channel (Q848850): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s00453-008-9192-0 / rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00453-008-9192-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2060429191 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The rank of sparse random matrices over finite fields / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3950588 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4948022 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4521546 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Raptor codes on binary memoryless symmetric channels / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5538637 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4222739 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4526978 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3547632 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S00453-008-9192-0 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 06:16, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Random matrices and codes for the erasure channel |
scientific article |
Statements
Random matrices and codes for the erasure channel (English)
0 references
23 February 2010
0 references
random matrices
0 references
bipartite graphs
0 references
erasure codes
0 references
random codes
0 references
decoding complexity
0 references