An upper bound for codes for the noisy two-access binary adder channel (Corresp.) (Q3726002)
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 3956965
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound for codes for the noisy two-access binary adder channel (Corresp.) |
scientific article; zbMATH DE number 3956965 |
Statements
An upper bound for codes for the noisy two-access binary adder channel (Corresp.) (English)
0 references
1986
0 references
combinatorial upper bound
0 references
decodable code pair
0 references
0.8129270076751709
0 references
0.8037540316581726
0 references
0.8034883141517639
0 references
