Soljanin, 2002 - Google Patents
Compressing quantum mixed-state sources by sending classical informationSoljanin, 2002
View PDF- Document ID
- 2995954429198488974
- Author
- Soljanin E
- Publication year
- Publication venue
- IEEE Transactions on Information Theory
External Links
Snippet
We consider visible compression for discrete memoryless sources of mixed quantum states when only classical information can be sent from Alice to Bob. We assume that Bob knows the source statistics, and that Alice and Bob have access to the same source of random …
- 238000007906 compression 0 abstract description 69
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
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
-
- 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
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0057—Block codes
-
- 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
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same information or similar information or a subset of information is represented by a different sequence or number of digits
- H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/47—Error detection, forward error correction or error protection, not provided for in groups H03M13/01 - H03M13/37
-
- 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/34—Encoding or coding, e.g. Huffman coding or error correction
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Devetak | The private classical capacity and quantum capacity of a quantum channel | |
| Winter | Coding theorems of quantum information theory | |
| Oohama | Gaussian multiterminal source coding | |
| Verdu | Fifty years of Shannon theory | |
| Devetak et al. | The capacity of a quantum channel for simultaneous transmission of classical and quantum information | |
| Holevo | The capacity of the quantum channel with general signal states | |
| Smith et al. | The quantum capacity with symmetric side channels | |
| Alajaji et al. | An introduction to single-user information theory | |
| Merhav | The generalized stochastic likelihood decoder: Random coding and expurgated bounds | |
| Raginsky | Empirical processes, typical sequences, and coordinated actions in standard borel spaces | |
| Tang et al. | Capacity of noisy permutation channels | |
| Soljanin | Compressing quantum mixed-state sources by sending classical information | |
| Pereg et al. | Communication with unreliable entanglement assistance | |
| Wiese et al. | An achievable region for the wiretap multiple-access channel with common message | |
| Luo et al. | Channel simulation with quantum side information | |
| Lee et al. | Streaming data transmission in the moderate deviations and central limit regimes | |
| Boche et al. | The classical-quantum multiple access channel with conferencing encoders and with common messages | |
| Merhav | Guessing individual sequences: generating randomized guesses using finite–state machines | |
| Lim et al. | Towards an algebraic network information theory: Distributed lossy computation of linear functions | |
| Oufkir et al. | Error exponent of activated non-signaling assisted classical-quantum channel coding | |
| Haroutunian | On Bounds for $ E $-capacity of DMC | |
| Ramachandran | State-dependent broadcast channels with reversible input constraints | |
| Simonyi | On Witsenhausen's zero-error rate for multiple sources | |
| AT&T | ||
| Guo et al. | Some cryptanalytic and coding-theoretic applications of a soft stern algorithm |