On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications (Q3548287)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5455526
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications |
scientific article; zbMATH DE number 5455526 |
Statements
On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications (English)
0 references
21 December 2008
0 references
0.8599652647972107
0 references
0.8423987627029419
0 references
0.8355516791343689
0 references
0.8276658058166504
0 references
0.8184399008750916
0 references
