skip to main content
Language:
Search Limited to: Search Limited to: Resource type Show Results with: Show Results with: Search type Index

Results 1 - 20 of 3,092  for All Library Resources

Results 1 2 3 4 5 next page
Show only
Refined by: subject: Channels remove
Result Number Material Type Add to My Shelf Action Record Details and Options
1
Quantum Network Discrimination
Material Type:
Article
Add to My Research

Quantum Network Discrimination

arXiv.org, 2021-03 [Peer Reviewed Journal]

2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://creativecommons.org/licenses/by/4.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2103.02404

Full text available

2
DoF Analysis for (M, N)-Channels through a Number-Filling Puzzle
Material Type:
Article
Add to My Research

DoF Analysis for (M, N)-Channels through a Number-Filling Puzzle

arXiv.org, 2024-02

2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://creativecommons.org/licenses/by/4.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2402.02189

Full text available

3
An Improved Lower Bound on Oblivious Transfer Capacity via Interactive Erasure Emulation
Material Type:
Article
Add to My Research

An Improved Lower Bound on Oblivious Transfer Capacity via Interactive Erasure Emulation

arXiv.org, 2024-01

2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://creativecommons.org/licenses/by/4.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2401.14965

Full text available

4
Optimal 1-bit Error Exponent for 2-hop Relaying with Binary-Input Channels
Material Type:
Article
Add to My Research

Optimal 1-bit Error Exponent for 2-hop Relaying with Binary-Input Channels

arXiv.org, 2023-11

2023. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://creativecommons.org/licenses/by/4.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2311.14251

Full text available

5
Derivatives of mutual information in Gaussian channels
Material Type:
Article
Add to My Research

Derivatives of mutual information in Gaussian channels

arXiv.org, 2023-11

2023. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://creativecommons.org/licenses/by/4.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2303.02500

Full text available

6
Adversarial Channels with O(1)-Bit Partial Feedback
Material Type:
Article
Add to My Research

Adversarial Channels with O(1)-Bit Partial Feedback

arXiv.org, 2023-05

2023. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://arxiv.org/licenses/nonexclusive-distrib/1.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2305.14541

Full text available

7
Hypothesis Testing for Adversarial Channels: Chernoff-Stein Exponents
Material Type:
Article
Add to My Research

Hypothesis Testing for Adversarial Channels: Chernoff-Stein Exponents

arXiv.org, 2023-04

2023. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://arxiv.org/licenses/nonexclusive-distrib/1.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2304.14166

Full text available

8
A General Formula for Uniform Common Randomness Capacity
Material Type:
Article
Add to My Research

A General Formula for Uniform Common Randomness Capacity

arXiv.org, 2022-09

2022. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://arxiv.org/licenses/nonexclusive-distrib/1.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2205.04594

Full text available

9
Power Measurement Based Channel Estimation for IRS-Enhanced Wireless Coverage
Material Type:
Article
Add to My Research

Power Measurement Based Channel Estimation for IRS-Enhanced Wireless Coverage

arXiv.org, 2024-05

2024. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://arxiv.org/licenses/nonexclusive-distrib/1.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2405.12432

Full text available

10
Computability of the Zero-Error Capacity of Noisy Channels
Material Type:
Article
Add to My Research

Computability of the Zero-Error Capacity of Noisy Channels

arXiv.org, 2024-05

2024. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://arxiv.org/licenses/nonexclusive-distrib/1.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2010.06873

Full text available

11
Low Complexity Successive Cancellation Decoding of Polar Codes based on Pruning Strategy in Deletion Error Channels
Material Type:
Article
Add to My Research

Low Complexity Successive Cancellation Decoding of Polar Codes based on Pruning Strategy in Deletion Error Channels

arXiv.org, 2024-05

2024. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://arxiv.org/licenses/nonexclusive-distrib/1.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2405.12245

Full text available

12
Computability of the Channel Reliability Function and Related Bounds
Material Type:
Article
Add to My Research

Computability of the Channel Reliability Function and Related Bounds

arXiv.org, 2024-05

2024. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://arxiv.org/licenses/nonexclusive-distrib/1.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2101.09754

Full text available

13
Sparse Regression Codes for Non-Coherent SIMO channels
Material Type:
Article
Add to My Research

Sparse Regression Codes for Non-Coherent SIMO channels

arXiv.org, 2024-05

2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://creativecommons.org/licenses/by/4.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2405.09915

Full text available

14
Analytical Characterization of the Operational Diversity Order in Fading Channels
Material Type:
Article
Add to My Research

Analytical Characterization of the Operational Diversity Order in Fading Channels

arXiv.org, 2024-05

2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://creativecommons.org/licenses/by/4.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2405.09336

Full text available

15
Optimal Transmitter Design and Pilot Spacing in MIMO Non-Stationary Aging Channels
Material Type:
Article
Add to My Research

Optimal Transmitter Design and Pilot Spacing in MIMO Non-Stationary Aging Channels

arXiv.org, 2024-05

2024. This work is published under http://creativecommons.org/publicdomain/zero/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://creativecommons.org/publicdomain/zero/1.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2405.07895

Full text available

16
Channel Coding with Mean and Variance Cost Constraints
Material Type:
Article
Add to My Research

Channel Coding with Mean and Variance Cost Constraints

arXiv.org, 2024-05

2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://creativecommons.org/licenses/by/4.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2401.16417

Full text available

17
Information Rates Over Multi-View Channels
Material Type:
Article
Add to My Research

Information Rates Over Multi-View Channels

arXiv.org, 2024-05

2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://creativecommons.org/licenses/by/4.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2405.07264

Full text available

18
Deterministic Identification Codes for Fading Channels
Material Type:
Article
Add to My Research

Deterministic Identification Codes for Fading Channels

arXiv.org, 2024-05

2024. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://arxiv.org/licenses/nonexclusive-distrib/1.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2404.02723

Full text available

19
Movable Antennas-Enabled Two-User Multicasting: Do We Really Need Alternating Optimization for Minimum Rate Maximization?
Material Type:
Article
Add to My Research

Movable Antennas-Enabled Two-User Multicasting: Do We Really Need Alternating Optimization for Minimum Rate Maximization?

arXiv.org, 2024-05

2024. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://arxiv.org/licenses/nonexclusive-distrib/1.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2405.04120

Full text available

20
ORBGRAND: Achievable Rate for General Bit Channels and Application in BICM
Material Type:
Article
Add to My Research

ORBGRAND: Achievable Rate for General Bit Channels and Application in BICM

arXiv.org, 2024-04

2024. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://arxiv.org/licenses/nonexclusive-distrib/1.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2401.11901

Full text available

Results 1 - 20 of 3,092  for All Library Resources

Results 1 2 3 4 5 next page

Personalize your results

  1. Edit

Refine Search Results

Expand My Results

  1.   

Show only

  1. Peer-reviewed Journals (1)

Refine My Results

Creation Date 

From To
  1. Before 2009  (165)
  2. 2009 To 2011  (418)
  3. 2012 To 2014  (588)
  4. 2015 To 2018  (833)
  5. After 2018  (1,089)
  6. More options open sub menu

Searching Remote Databases, Please Wait