Achieving Full Multiplexing and Unbounded Caching Gains with Bounded Feedback Resources

Eleftherios Lampiris, Petros Elia

Open source

DOI: 10.1109/isit.2018.8437704
Published: 2018-06
Container: 2018 IEEE International Symposium on Information Theory (ISIT)
Publisher: IEEE
Open access: unknown

Credibility signals

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

Show all credibility signals

supportingDOI registered: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
supportingDOI resolves: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility. Source: DOAJ; license: CC0
not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredROR affiliation: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredOpen access status: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication license: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication version: A publication version was supplied but is not scored. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
supportingMetadata completeness: All 6 scored descriptive metadata groups are present. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer

Cite this work

BibTeX

@article{allodium:10.1109/isit.2018.8437704,
  title = {Achieving Full Multiplexing and Unbounded Caching Gains with Bounded Feedback Resources},
  author = {Eleftherios Lampiris and Petros Elia},
  year = {2018},
  journal = {2018 IEEE International Symposium on Information Theory (ISIT)},
  doi = {10.1109/isit.2018.8437704},
  url = {https://doi.org/10.1109/isit.2018.8437704}
}

RIS

TY  - JOUR
TI  - Achieving Full Multiplexing and Unbounded Caching Gains with Bounded Feedback Resources
AU  - Eleftherios Lampiris
AU  - Petros Elia
PY  - 2018
JO  - 2018 IEEE International Symposium on Information Theory (ISIT)
DO  - 10.1109/isit.2018.8437704
UR  - https://doi.org/10.1109/isit.2018.8437704
ER  -

APA

Lampiris, E., & Elia, P. (2018). Achieving Full Multiplexing and Unbounded Caching Gains with Bounded Feedback Resources. 2018 IEEE International Symposium on Information Theory (ISIT). https://doi.org/10.1109/isit.2018.8437704

Source records

crossref · retrieved 2026-11-06T09:07:34.548Z