Commitment Capacity of Discrete Memoryless Channels (original) (raw)
Anderson Nascimento2003, Cryptography and Coding
visibility
…
description
21 pages
link
1 file
Sign up for access to the world's latest research.
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Related papers
Channel and capacity estimation errors
IEEE Communications Letters, 2002
European Journal of Combinatorics
Storage and delivery constrained unit commitment
IEEE Transactions on Power Systems, 1996
Channel Power in Multi-Channel Environments
2004
On Reverse Elastic Channels and the Asymmetry of Commitment Capacity under Channel Elasticity
IEEE Journal on Selected Areas in Communications, 2022
Qubit Channels Can Require More Than Two Inputs to Achieve Capacity
Physical Review Letters, 2002
Unfair Noisy Channels and Oblivious Transfer
Lecture Notes in Computer Science, 2004
Capacity approaching signal constellations for channels with memory
2001
Proceedings of the 20th annual international symposium on Computer architecture - ISCA '93, 1993
EXIT functions for binary input memoryless symmetric channels
IEEE Transactions on Communications, 2006
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.
Related papers
Strong Coordination Over Noisy Channels
IEEE Transactions on Information Theory, 2021
Limited Information Capacity as a Source of Inertia
2002
2017
Capacity regions of discrete asynchronous multiple access channels
2011
Bedload fill of abandoned channels
2020
RESOURCE 2023 Proceedings excerpt 63-
Engineering Process for Capacity-Driven Web Services
Proceedings of the 12th International Conference on Enterprise Information Systems
The Stream of Enculturated Consciousness
2013
Getting to the Rule of Law
Conflict-free access for streams in multimodule memories
IEEE Transactions on Computers, 1995
Review on unit commitment under uncertainty approaches
2015 38th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO), 2015
On the Inner and Outer Bounds for 2 Receiver Discrete Memoryless Broadcast Channels
arXiv: Information Theory, 2008
Realizability of Service Specifications
System Analysis and Modeling. Languages, Methods, and Tools for Systems Engineering, 2018
Simulation-Based Computation of Information Rates for Channels With Memory
IEEE Transactions on Information Theory, 2006
A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols
Lecture Notes in Computer Science, 2000
Philosophies, 2024
Resource Management and Network Layer
Resource Management in Satellite Networks
Information management & computer science, 2022
Substitutions, Trajectories and Noisy Channels
Lecture Notes in Computer Science, 2005
On the Capacity of Multiplicative Finite-Field Matrix Channels
IEEE Transactions on Information Theory, 2013
7TH International Conference on Computer Communication
Computer Networks (1976), 1984
Isochronous Data Transmission With Rates Close to Channel Capacity
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks, 2007
2012
Partial feedback for the discrete memoryless multiple access channel (Corresp.)
IEEE Transactions on Information Theory, 1983
Sensitivity of Application Performance to Resource Availability
Proceedings of the 10th EAI International Conference on Performance Evaluation Methodologies and Tools, 2017
Related topics
Computer SciencePhysicsQuantum PhysicsLower BoundEquivocationChannel Capacity