Saldi et al., 2015 - Google Patents
Output constrained lossy source coding with limited common randomnessSaldi et al., 2015
View PDF- Document ID
- 7699545575476686469
- Author
- Saldi N
- Linder T
- Yüksel S
- Publication year
- Publication venue
- IEEE Transactions on Information Theory
External Links
Snippet
This paper studies a Shannon-theoretic version of the generalized distribution preserving quantization problem where a stationary and memoryless source is encoded subject to a distortion constraint and the additional requirement that the reproduction also be stationary …
- 230000002194 synthesizing 0 abstract description 14
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0819—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s)
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television, VOD [Video On Demand]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
- H04N21/234—Processing of video elementary streams, e.g. splicing of content streams, manipulating MPEG-4 scene graphs
- H04N21/2343—Processing of video elementary streams, e.g. splicing of content streams, manipulating MPEG-4 scene graphs involving reformatting operations of video signals for distribution or compliance with end-user requests or end-user device requirements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/60—Digital content management, e.g. content distribution
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
- H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
- H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/30—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Saldi et al. | Output constrained lossy source coding with limited common randomness | |
Li et al. | Strong functional representation lemma and applications to coding theorems | |
Johnson et al. | On compressing encrypted data | |
Yard et al. | Capacity theorems for quantum multiple-access channels: Classical-quantum and quantum-quantum capacity regions | |
Yard et al. | Quantum broadcast channels | |
Datta et al. | Quantum rate distortion, reverse Shannon theorems, and source-channel separation | |
Saldi et al. | Randomized quantization and source coding with constrained output distribution | |
Whang et al. | Neural distributed source coding | |
Hsieh et al. | Channel simulation and coded source compression | |
Chou et al. | Empirical and strong coordination via soft covering with polar codes | |
Khanian et al. | Distributed compression of correlated classical-quantum sources or: The price of ignorance | |
Kipnis et al. | Compressed sensing under optimal quantization | |
Deligiannis et al. | Maximum likelihood Laplacian correlation channel estimation in layered Wyner-Ziv coding | |
Raginsky | Empirical processes, typical sequences, and coordinated actions in standard borel spaces | |
Yang et al. | Rate distortion theory for causal video coding: Characterization, computation algorithm, and comparison | |
Chia et al. | Estimation with a helper who knows the interference | |
Merhav | Perfectly secure encryption of individual sequences | |
Wang et al. | Efficient compression of encrypted binary images using the Markov random field | |
Mamindlapally et al. | Singleton bounds for entanglement-assisted classical and quantum error correcting codes | |
Schonberg | Practical distributed source coding and its application to the compression of encrypted data | |
Cuvelier et al. | Time-invariant prefix coding for LQG control | |
Wang et al. | Separation between quantum Lovász number and entanglement-assisted zero-error classical capacity | |
Yassaee | One-shot achievability via fidelity | |
Kumar et al. | An efficient compression of encrypted images using WDR coding | |
Devetak et al. | The operational meaning of quantum conditional information |