Fetching the paper…
Reading the bibliography…
An unexpected breakdown in the existing theory of quantum serial turbo coding is that a quantum convolutional encoder cannot simultaneously be recursive and non-catastrophic.
C. E. Shannon, “A mathematical theory of communication,” Bell System Technical Journal , vol. 27, pp. 379–423, 1948
1948
Earlier work this paper cites.
A. J. Viterbi, “Convolutional codes and their performance in communication systems,” IEEE Transactions on Communication Technology , vol. 19, no. 5, pp. 751–772, October 1971
1971
Earlier work this paper cites.
M. L. Cedervall and R. Johannesson, “A fast algorithm for computing distance spectrum of convolutional codes,” IEEE Transactions on Information Theory , vol. 35, no. 6, pp. 1146–1159, November 1989
1989
Earlier work this paper cites.
C. H. Bennett and S. J. Wiesner, “Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states,” Physical Review Letters , vol. 69, no. 20, pp. 2881–2884, November 1992
1992
Earlier work this paper cites.
C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: Turbo-codes,” in Technical Program of the IEEE International Conference on Communications , vol. 2, Geneva, Switzerland, May 1993, pp. 1064–1070
1993
Earlier work this paper cites.
A. S. Barbulescu and S. S. Pietrobon, “Interleaver design for turbo codes,” Electronics Letters , vol. 30, no. 25, pp. 2107–2108, December 1994
1994
Earlier work this paper cites.
S. Dolinar and D. Divsalar, “Weight distribution for turbo codes using random and nonrandom permutations,” JPL Progress report , vol. 42, no. 122, pp. 56–65, August 1995
1995
Earlier work this paper cites.
S. Benedetto and G. Montorsi, “Unveiling turbo codes: Some results on parallel concatenated coding schemes,” IEEE Transactions on Information Theory , vol. 42, no. 2, pp. 409–428, March 1996
1996
Earlier work this paper cites.
C. Berrou and A. Glavieux, “Near optimum error correcting coding and decoding: Turbo-codes,” IEEE Transactions on Communications , vol. 44, no. 10, pp. 1261–1271, October 1996
1996
Earlier work this paper cites.
A. R. Calderbank and P. W. Shor, “Good quantum error-correcting codes exist,” Physical Review A , vol. 54, no. 2, pp. 1098–1105, August 1996
1996
Earlier work this paper cites.
A. M. Steane, “Error correcting codes in quantum theory,” Physical Review Letters , vol. 77, no. 5, pp. 793–797, July 1996
1996
Earlier work this paper cites.
P. W. Shor and J. Smolin, “Quantum error-correcting codes need not completely reveal the error syndrome,” April 1996, arXiv:quant-ph/9604006
1996
Earlier work this paper cites.
C. H. Bennett, D. P. DiVincenzo, J. A. Smolin, and W. K. Wootters, “Mixed-state entanglement and quantum error correction,” Physical Review A , vol. 54, no. 5, pp. 3824–3851, November 1996
1996
Earlier work this paper cites.
S. Lloyd, “Capacity of the noisy quantum channel,” Physical Review A , vol. 55, no. 3, pp. 1613–1622, March 1997
1997
Earlier work this paper cites.
A. J. Viterbi, A. M. Viterbi, and N. T. Sindhushayana, “Interleaved concatenated codes: New perspectives on approaching the shannon limit,” Proceedings of the National Academy of Sciences of the United States of America , vol. 94, pp. 9525–9531, September 1997
1997
Earlier work this paper cites.
D. Gottesman, “Stabilizer codes and quantum error correction,” Ph.D. dissertation, California Institute of Technology, 1997
1997
Earlier work this paper cites.
P. Shor and R. Laflamme, “Quantum analog of the MacWilliams identities for classical coding theory,” Physical Review Letters , vol. 78, no. 8, pp. 1600–1602, February 1997
1997
Earlier work this paper cites.
S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, “A soft-input soft-output APP module for iterative decoding of concatenated codes,” IEEE Communications Letters , vol. 1, no. 1, pp. 22–24, 1997
1997
Earlier work this paper cites.
S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, “Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding,” IEEE Transactions on Information Theory , vol. 44, no. 3, pp. 909–926, May 1998
1998
Earlier work this paper cites.
N. Kahale and R. Urbanke, “On the minimum distance of parallel and serially concatenated codes,” in Proceedings of the International Symposium on Information Theory , Cambridge, Massachussetts, USA, August 1998, p. 31. [Online]. Available: http://lthcwww.epfl.ch/{~}ruediger/papers/weight.ps
1998
Earlier work this paper cites.
D. P. DiVincenzo, P. W. Shor, and J. A. Smolin, “Quantum-channel capacity of very noisy channels,” Physical Review A , vol. 57, no. 2, pp. 830–839, February 1998
1998
Earlier work this paper cites.
R. J. McEliece, Communications and Coding (P. G. Farrell 60th birthday celebration) . New York: John Wiley & Sons, 1998, ch. How to Compute Weight Enumerators for Convolutional Codes, pp. 121–141
1998
Earlier work this paper cites.
C. H. Bennett, P. W. Shor, J. A. Smolin, and A. V. Thapliyal, “Entanglement-assisted classical capacity of noisy quantum channels,” Physical Review Letters , vol. 83, no. 15, pp. 3081–3084, October 1999
1999
Earlier work this paper cites.
R. Johannesson and K. S. Zigangirov, Fundamentals of Convolutional Coding . Wiley-IEEE Press, 1999
1999
Earlier work this paper cites.
J. Preskill, Lecture Notes on Quantum Computation , 1999, ch. Quantum Error Correction (Chapter 7), pp. 15–16. [Online]. Available: http://www.theory.caltech.edu/people/preskill/ph229/notes/chap7.pdf
1999
Earlier work this paper cites.
J. Yuan, B. Vucetic, and W. Feng, “Combined turbo codes and interleaver design,” IEEE Transactions on Communications , vol. 47, no. 4, pp. 484–487, April 1999
1999
Earlier work this paper cites.
H. R. Sadjadpour, N. J. A. Sloane, M. Salehi, and G. Nebe, “Interleaver design for turbo codes,” IEEE Journal on Selected Areas in Communications , vol. 19, no. 5, pp. 831–837, May 2001
2001
Earlier work this paper cites.
P. W. Shor, “The quantum channel capacity and coherent information,” in Lecture Notes, MSRI Workshop on Quantum Computation , 2002
2002
Earlier work this paper cites.
——, “Entanglement-assisted capacity of a quantum channel and the reverse shannon theorem,” IEEE Transactions on Information Theory , vol. 48, pp. 2637–2655, 2002
2002
Earlier work this paper cites.
G. Bowen, “Entanglement required in achieving entanglement-assisted channel capacities,” Physical Review A , vol. 66, no. 5, p. 052313, November 2002
2002
Earlier work this paper cites.
R. J. McEliece, The Theory of Information and Coding . Cambridge University Press, 2002
2002
Earlier work this paper cites.
D. P. DiVincenzo, D. W. Leung, and B. M. Terhal, “Quantum data hiding,” IEEE Transactions on Information Theory , vol. 48, no. 3, pp. 580–598, March 2002
2002
Cited alongside, same era.
H. Jin and R. J. McEliece, “Coding theorems for turbo code ensembles,” IEEE Transactions on Information Theory , vol. 48, no. 6, pp. 1451–1461, June 2002
2002
Cited alongside, same era.
H. Ollivier and J.-P. Tillich, “Description of a quantum convolutional code,” Physical Review Letters , vol. 91, no. 17, p. 177902, October 2003
2003
Cited alongside, same era.
I. Devetak, A. W. Harrow, and A. Winter, “A family of quantum protocols,” Physical Review Letters , vol. 93, no. 23, p. 230504, December 2004
2004
Cited alongside, same era.
D. J. MacKay, G. Mitchison, and P. L. McFadden, “Sparse graph codes for quantum error-correction,” IEEE Transactions on Information Theory , vol. 50, no. 10, p. 2315, October 2004
J.-P. Tillich, “Quantum codes suitable for iterative decoding,” Online presentation, May 2009. [Online]. Available: http://www.infres.enst.fr/{~}markham/QuPa/28May/exposeJPTillich.pdf
2009
Later among the works it cites.
I. Devetak, T. A. Brun, and M.-H. Hsieh, New Trends in Mathematical Physics . Springer Netherlands, 2009, ch. Entanglement-Assisted Quantum Error-Correcting Codes, pp. 161–172
2009
Later among the works it cites.
M. M. Wilde and T. A. Brun, “Extra shared entanglement reduces memory demand in quantum convolutional coding,” Physical Review A , vol. 79, no. 3, p. 032313, March 2009
2009
Later among the works it cites.
M. M. Wilde, “Quantum-shift-register circuits,” Physical Review A , vol. 79, no. 6, p. 062325, June 2009
2009
Later among the works it cites.
A. Abeyesinghe, I. Devetak, P. Hayden, and A. Winter, “The mother of all protocols: restructuring quantum information’s family tree,” Proceedings of the Royal Society A , vol. 465, no. 2108, pp. 2537–2563, 2009
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2004
Cited alongside, same era.
I. Devetak, “The private classical capacity and quantum capacity of a quantum channel,” IEEE Transactions on Information Theory , vol. 51, pp. 44–55, January 2005
2005
Cited alongside, same era.
D. Kribs, R. Laflamme, and D. Poulin, “Unified and generalized approach to quantum error correction,” Physical Review Letters , vol. 94, no. 18, p. 180501, 2005
2005
Cited alongside, same era.
D. Poulin, “Stabilizer formalism for operator quantum error correction,” Physical Review Letters , vol. 95, no. 23, p. 230504, 2005
2005
Cited alongside, same era.
I. Devetak and P. W. Shor, “The capacity of a quantum channel for simultaneous transmission of classical and quantum information,” Communications in Mathematical Physics , vol. 256, pp. 287–303, 2005
2005
Cited alongside, same era.
T. A. Brun, I. Devetak, and M.-H. Hsieh, “Correcting quantum errors with entanglement,” Science , vol. 314, no. 5798, pp. 436–439, October 2006
2006
Cited alongside, same era.
M. Grassl, “Convolutional and block quantum error-correcting codes,” in IEEE Information Theory Workshop , Chengdu, October 2006, pp. 144–148
2006
Cited alongside, same era.
M. Grassl and M. Rötteler, “Noncatastrophic encoders and encoder inverses for quantum convolutional codes,” in Proceedings of the IEEE International Symposium on Information Theory , Seattle, Washington, USA, July 2006, pp. 1109–1113, arXiv:quant-ph/0602129
2006
Cited alongside, same era.
2009
Later among the works it cites.
M.-H. Hsieh, T. A. Brun, and I. Devetak, “Entanglement-assisted quantum quasicyclic low-density parity-check codes,” Physical Review A , vol. 79, no. 3, p. 032340, March 2009
2009
Later among the works it cites.
M. M. Wilde and D. Fattal, “Nonlocal quantum information in bipartite quantum error correction,” Quantum Information Processing , vol. 9, no. 5, pp. 591–610, September 2009
2009
Later among the works it cites.
Y. Dong, X. Deng, M. Jiang, Q. Chen, and S. Yu, “Entanglement-enhanced quantum error-correcting codes,” Physical Review A , vol. 79, no. 4, p. 042342, April 2009
2009
Later among the works it cites.
M. M. Wilde and T. A. Brun, “Entanglement-assisted quantum convolutional coding,” Physical Review A , vol. 81, no. 4, p. 042333, April 2010
2010
Closest in time.
2010
Closest in time.
F. Dupuis, P. Hayden, and K. Li, “A father protocol for quantum broadcast channels,” IEEE Transactions on Information Theory , vol. 56, no. 6, pp. 2946–2956, June 2010
2010
Closest in time.
2010
Closest in time.
2010
Closest in time.
2010
Closest in time.
2010
Closest in time.
M. M. Wilde, “EA-Turbo,” http://code.google.com/p/ea-turbo/, September 2010, Matlab and MEX software for characterizing and simulating entanglement-assisted quantum turbo codes (source code available under a GPL license)
2010
Closest in time.
P. Tan and J. Li, “Efficient quantum stabilizer codes: LDPC and LDPC-convolutional constructions,” IEEE Transactions on Information Theory , vol. 56, no. 1, pp. 476–491, January 2010
2010
Closest in time.
2010
Closest in time.
M. M. Wilde and M.-H. Hsieh, “Entanglement generation with a quantum channel and a shared state,” in Proceedings of the 2010 IEEE International Symposium on Information Theory , Austin, Texas, USA, June 2010, pp. 2713–2717
2010
Closest in time.
2011
Closest in time.
L. Hanzo, T. H. Liew, B. L. Yeap, R. Y. S. Tee, and S. X. Ng, Turbo Coding, Turbo Equalisation and Space-Time Coding: EXIT-Chart-Aided Near-Capacity Designs for Wireless Channels, 2nd Edition . New York, USA: John Wiley IEEE Press, March 2011
2011
Closest in time.
L. Hanzo, R. G. Maunder, J. Wang, and L. Yang, Near-Capacity Variable-Length Coding:Regular and EXIT-Chart-Aided Irregular Designs . John Wiley IEEE Press, 2011
2011
Closest in time.
2011
Closest in time.
2012
Closest in time.
2012
Closest in time.
2012
Closest in time.
2012
Closest in time.
2012
Closest in time.
2012
Closest in time.
Z. Babar, S. X. Ng, and L. Hanzo, “Convergence analysis of quantum turbo codes using EXIT charts,” 2013, unpublished manuscript
2013
Closest in time.