Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel (Q3671037)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel |
scientific article; zbMATH DE number 3823650
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel |
scientific article; zbMATH DE number 3823650 |
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
