An upper bound for codes for the noisy two-access binary adder channel (Corresp.) (Q3726002)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for codes for the noisy two-access binary adder channel (Corresp.) |
scientific article |
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
