A Finite-Length Algorithm for LDPC Codes Without Repeated Edges on the Binary Erasure Channel (Q4975669): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q60614428, #quickstatements; #temporary_batch_1705521228510 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/tit.2008.2008118 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2139367252 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:25, 30 July 2024
scientific article; zbMATH DE number 6757245
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Finite-Length Algorithm for LDPC Codes Without Repeated Edges on the Binary Erasure Channel |
scientific article; zbMATH DE number 6757245 |
Statements
A Finite-Length Algorithm for LDPC Codes Without Repeated Edges on the Binary Erasure Channel (English)
0 references
8 August 2017
0 references
