An approach to the performance of SPC product codes on the erasure channel (Q259259): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the number of spanning trees of \(K_ n\) and \(K_{m,n}\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recoverability study of SPC product codes under erasure decoding / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4947393 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5747637 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3474660 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Single parity check product codes / rank | |||
Normal rank |
Revision as of 14:25, 11 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An approach to the performance of SPC product codes on the erasure channel |
scientific article |
Statements
An approach to the performance of SPC product codes on the erasure channel (English)
0 references
11 March 2016
0 references
erasure channel
0 references
SPC code
0 references
erasure pattern
0 references
bipartite graph
0 references
connected component
0 references