Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Link opens in a new tab
Search content at Princeton University
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Lossy joint source-channel coding in the finite blocklength regime
Victoria Kostina
, Sergio Verdu
Electrical and Computer Engineering
Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
137
Link opens in a new tab
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Lossy joint source-channel coding in the finite blocklength regime'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Computer Science
Channel Channel
100%
Channel Capacity
100%
rate distortion
100%
joint source channel coding
100%
Uncoded Transmission
100%
Cumulative Distribution
100%
Memoryless Source
100%
Matching Condition
100%
Probability
100%
Keyphrases
Joint Source-channel Coding
100%
Distributed Joint Source-channel Coding (DJSCC)
100%
Finite Blocklength Regime
100%
Non-asymptotic
50%
Channel Capacity
25%
Codeword
25%
Tight
25%
Source Rate
25%
Code Design
25%
Uncoded Transmission
25%
Code Rate
25%
Channel Dispersion
25%
N-channel
25%
Lossy
25%
Memoryless Channels
25%
Memoryless Sources
25%
Performance Advantage
25%
Dispersion Law
25%
Complementary Cumulative Distribution Function
25%
Probabilistic Matching
25%
Shannon Limit
25%
Rate-distortion
25%
Finite Blocklength Bound
25%
Engineering
Channel Coding
100%
Joint Source
100%
Blocklength
100%
Channel Code
80%
Channel Capacity
20%
Gaussians
20%
Matching Condition
20%
Code Rate
20%
Channel Dispersion
20%
Source Rate
20%
Memoryless Source
20%
Cumulative Distribution Function
20%
Shannon Limit
20%