Upper bounds on<tex>|C_2|</tex>for a uniquely decodable code pair<tex>(C_1, C_2)</tex>for a two-access binary adder channel (Q3037313)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bounds on&lt;tex&gt;|C_2|&lt;/tex&gt;for a uniquely decodable code pair&lt;tex&gt;(C_1, C_2)&lt;/tex&gt;for a two-access binary adder channel |
scientific article |
Statements
Upper bounds on&lt;tex&gt;|C_2|&lt;/tex&gt;for a uniquely decodable code pair&lt;tex&gt;(C_1, C_2)&lt;/tex&gt;for a two-access binary adder channel (English)
0 references
1983
0 references
group algebra
0 references
Krawtchouk polynomial
0 references
uniquely decodable code pair
0 references
two- access binary adder channel with two users
0 references
