Code construction for the noiseless binary switching multiple-access channel (Q3818236)
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 4089466
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Code construction for the noiseless binary switching multiple-access channel |
scientific article; zbMATH DE number 4089466 |
Statements
Code construction for the noiseless binary switching multiple-access channel (English)
0 references
1989
0 references
noiseless coding problem
0 references
discrete memoryless multiple-access channel
0 references
binary adder channel
0 references
Upper and lower bounds
0 references
zero-error capacity
0 references
convolutional codes
0 references
0.8348859548568726
0 references
0.7973095178604126
0 references
0.7892951965332031
0 references
0.7839410305023193
0 references
