On the achievability of cut-set bound for a class of erasure relay channels

R. Khalili, K. Salamatian

Open source

DOI
10.1109/iwwan.2004.1525585
Published
Not recorded
Container
International Workshop on Wireless Ad-Hoc Networks, 2004.
Publisher
IEEE
Open access
unknown

Credibility signals

uncertain Score 58/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1109/iwwan.2004.1525585,
  title = {On the achievability of cut-set bound for a class of erasure relay channels},
  author = {R. Khalili and K. Salamatian},
  journal = {International Workshop on Wireless Ad-Hoc Networks, 2004.},
  doi = {10.1109/iwwan.2004.1525585},
  url = {https://doi.org/10.1109/iwwan.2004.1525585}
}

RIS

TY  - JOUR
TI  - On the achievability of cut-set bound for a class of erasure relay channels
AU  - R. Khalili
AU  - K. Salamatian
JO  - International Workshop on Wireless Ad-Hoc Networks, 2004.
DO  - 10.1109/iwwan.2004.1525585
UR  - https://doi.org/10.1109/iwwan.2004.1525585
ER  - 

APA

Khalili, R., & Salamatian, K. (n.d.). On the achievability of cut-set bound for a class of erasure relay channels. International Workshop on Wireless Ad-Hoc Networks, 2004.. https://doi.org/10.1109/iwwan.2004.1525585

Source records