Design of extended dense coding protocol strategy based on combinatorial optimization
From MaRDI portal
(Redirected from Publication:6166201)
Recommendations
- Optimal probabilistic dense coding schemes
- Using combinatorial optimization to design good unit-memory convolutional codes
- On Practical Design for Joint Distributed Source and Network Coding
- Optimized design for accumulate rateless codes with iterative decoding number constraint
- Optimal combinatorial batch codes based on block designs
- A Channel-Aware Combinatorial Approach to Design High Performance Spatially-Coupled Codes
- Combinatorial optimization in digital communications
- Optimal design of simultaneous source encoding
- Optimal combinatorial batch codes derived from dual systems
- scientific article; zbMATH DE number 3511981
Cites work
- Canonical Factorization of Pseudo-Unitary Matrices
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- Entanglement enhanced information transmission of a Pauli memory channel
- On data structures and asymmetric communication complexity
- Quantum teleportation and dense coding via topological basis
- Quantumness, generalized spherical 2-design, and symmetric informationally complete POVM
- Second-Order Asymptotics for Source Coding, Dense Coding, and Pure-State Entanglement Conversions
- The Kronecker Product of Graphs
- The Pauli matrices in n dimensions and finest gradings of simple Lie algebras of type A n−1
- The capacity of a quantum channel for simultaneous transmission of classical and quantum information
- The classical capacity of a quantum dense coding system
- The quantum dense coding in a two atomic system under the non-Markovian environment
This page was built for publication: Design of extended dense coding protocol strategy based on combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166201)
