Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel (Q3671037): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 13:13, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel |
scientific article |
Statements
Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel (English)
0 references
1983
0 references
two-user multiple-access binary adder channel
0 references
multiple-access communication
0 references
independent set problem
0 references
independence number of a simple graph
0 references
lower bounds on the achievable rates
0 references
synchronized adder channel
0 references
uniquely decodable codes
0 references
nonsynchronized adder channel
0 references
Deaett-Wolf codes
0 references
synchronizing sequences
0 references
delta-decodable codes
0 references
multi-user communication
0 references
