scientific article
From MaRDI portal
Publication:2969050
DOI10.4230/LIPICS.TQC.2014.76zbMATH Open1359.81056arXiv1404.5153MaRDI QIDQ2969050FDOQ2969050
Authors: André Chailloux, Iordanis Kerenidis, Srijita Kundu, Jamie Sikora 
Publication date: 13 March 2017
Full work available at URL: https://arxiv.org/abs/1404.5153
Title of this publication is not available (Why is that?)
Recommendations
- Optimal bounds for parity-oblivious random access codes
- Sharp Bounds for Optimal Decoding of Low-Density Parity-Check Codes
- New bounds on \(D\)-ary optimal codes
- On lower bounds for the redundancy of optimal codes
- On Optimal and Achievable Fix-Free Codes
- A lower bound on the undetected error probability and strictly optimal codes
- Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes
- Some Upper Bounds on the Redundancy of Optimal Binary Fix-Free Codes
- On optimal constacyclic codes
- Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications
Cited In (7)
- Two instances of random access code in the quantum regime
- Mutually unbiased special entangled bases with Schmidt number 2d in ℂ2d+1 ⊗ ℂ4d
- Random access test as an identifier of nonclassicality
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- The geometry of Bloch space in the context of quantum random access codes
- Playing distributed two-party quantum games on quantum networks
- Optimal bounds for parity-oblivious random access codes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2969050)
