References
219
44. Fujiwara, Y., Vandendriessche, P.: Quantum synchronizable codes from finite geometries.
IEEE Trans. Inf. Theory 60, 7345–7354 (2014)
45. Galindo, C., Geil, O., Hernando, F., Ruano, D.: On the distance of stabilizer quantum codes
from J -affine variety codes. Quantum Inf. Process. 16, 111 (2017)
46. Galindo, C., Hernando, F., Ruano, D.: Stabilizer quantum codes from J-affine variety codes
and a new Steane-like enlargement. Quantum Inf. Process. 14, 3211–3231 (2015)
47. Garcia, A., Stichtenoth, H.: On the asymptotic behaviour of some towers of function fields
over finite fields. J. Number Theory 61, 248–273 (1996)
48. Gluesing-Luerssen, H., Rosenthal, J., Smarandache, R.: Strongly MDS convolutional codes.
IEEE Trans. Inf. Theory 52, 584–598 (2006)
49. Gluesing-Luerssen, H., Schmale, W.: Distance bounds for convolutional codes and some
optimal codes. e-print arXiv:math/0305135
50. Gluesing-Luerssen, H., Schmale, W.: On doubly-cyclic convolutional codes. AAECC 17,
151–170 (2006)
51. Gluesing-Luerssen, H., Tsang, F.L.: A matrix ring description for cyclic convolutional codes.
Adv. Math. Commun. 2, 55–81 (2008)
52. Goppa, V.D.: Codes associated with divisors. Problemes Peredachi Informatsii 13, 33–39
(1977) (English translation in Problems Inform Transmission) 13, 22–27 (1977)
53. Gottesman, D.: Class of quantum error-correcting codes saturating the quantum Hamming
bound. Phys. Rev. A 54, 1862–1868 (1996)
54. Grassl, M., Beth, Th., Pellizzari, T.: Codes for the quantum erasure channel. Phys. Rev. A 56,
33–38 (1997)
55. Grassl, M., Beth, T., Rötteler, M.: On optimal quantum codes. Int. J. Quantum Inf. 2, 55–64
(2004)
56. Grassl, M., Geiselmann, W., Beth, T.: Quantum Reed-Solomon codes. AAECC-13 1709,
231–244 (1999)
57. Grassl, M., Rötteler, M.: Quantum block and convolutional codes from self-orthogonal product
codes. In: International Symposium on Information Theory (ISIT), Adelaide, Australia, 4–8
Sept 2005
58. Grassl, M., Rötteler, M.: Constructions of quantum convolutional codes. In: IEEE International
Symposium on Information Theory (ISIT), Nice, France, 24–29 June 2007
59. Grassl, M., Rötteler, M.: Non-catastrophic encoders and encoder inverses for quantum convolutional codes. In: International Symposium on Information Theory (ISIT), Seattle, WA,
USA, 9–14 July 2006
60. Guenda, K.: Quantum duadic and affime invariant codes. Int. J. Quantum Inf. 7, 373–384
(2009)
61. Guenda, K., La Guardia, G.G., Gulliver, T.A.: Algebraic quantum synchronizable codes. J.
Appl. Math. Comput. 55, 393–407 (2017)
62. Hamada, M.: Concatenated quantum codes constructible in polynomial time: efficient decoding and error correction. IEEE Trans. Inf. Theory 54, 5689–5704 (2008)
63. Hocquenghem, A.: Codes correcteurs d’erreurs. Chiffres 2, 147–156 (1959)
64. Hoffman, K., Kunze, R.: Linear Algebra. Prentice-Hall Inc., New Jersey (1971)
65. Hole, K.J.: On classes of convolutional codes that are not asymptotically catastrophic. IEEE
Trans. Inf. Theory 46, 663–669 (2000)
66. Houshmand, M., Hosseini-Khayat, S., Wilde, M.M.: Minimal-memory, non-catastrophic,
polynomial-depth quantum convolutional encoders. IEEE Trans. Inf. Theory 59, 1198–1210
(2013)
67. Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University
Press, Cambridge (2003)
68. Hutchinson, R., Rosenthal, R., Smarandache, R.: Convolutional codes with maximum distance
profile. Syst. Control Lett. 54, 53–63 (2005)
69. Iglesias-Curto, J.I.: Generalized AG convolutional codes. Adv. Math. Commun. 3, 317–328
(2009)
219
44. Fujiwara, Y., Vandendriessche, P.: Quantum synchronizable codes from finite geometries.
IEEE Trans. Inf. Theory 60, 7345–7354 (2014)
45. Galindo, C., Geil, O., Hernando, F., Ruano, D.: On the distance of stabilizer quantum codes
from J -affine variety codes. Quantum Inf. Process. 16, 111 (2017)
46. Galindo, C., Hernando, F., Ruano, D.: Stabilizer quantum codes from J-affine variety codes
and a new Steane-like enlargement. Quantum Inf. Process. 14, 3211–3231 (2015)
47. Garcia, A., Stichtenoth, H.: On the asymptotic behaviour of some towers of function fields
over finite fields. J. Number Theory 61, 248–273 (1996)
48. Gluesing-Luerssen, H., Rosenthal, J., Smarandache, R.: Strongly MDS convolutional codes.
IEEE Trans. Inf. Theory 52, 584–598 (2006)
49. Gluesing-Luerssen, H., Schmale, W.: Distance bounds for convolutional codes and some
optimal codes. e-print arXiv:math/0305135
50. Gluesing-Luerssen, H., Schmale, W.: On doubly-cyclic convolutional codes. AAECC 17,
151–170 (2006)
51. Gluesing-Luerssen, H., Tsang, F.L.: A matrix ring description for cyclic convolutional codes.
Adv. Math. Commun. 2, 55–81 (2008)
52. Goppa, V.D.: Codes associated with divisors. Problemes Peredachi Informatsii 13, 33–39
(1977) (English translation in Problems Inform Transmission) 13, 22–27 (1977)
53. Gottesman, D.: Class of quantum error-correcting codes saturating the quantum Hamming
bound. Phys. Rev. A 54, 1862–1868 (1996)
54. Grassl, M., Beth, Th., Pellizzari, T.: Codes for the quantum erasure channel. Phys. Rev. A 56,
33–38 (1997)
55. Grassl, M., Beth, T., Rötteler, M.: On optimal quantum codes. Int. J. Quantum Inf. 2, 55–64
(2004)
56. Grassl, M., Geiselmann, W., Beth, T.: Quantum Reed-Solomon codes. AAECC-13 1709,
231–244 (1999)
57. Grassl, M., Rötteler, M.: Quantum block and convolutional codes from self-orthogonal product
codes. In: International Symposium on Information Theory (ISIT), Adelaide, Australia, 4–8
Sept 2005
58. Grassl, M., Rötteler, M.: Constructions of quantum convolutional codes. In: IEEE International
Symposium on Information Theory (ISIT), Nice, France, 24–29 June 2007
59. Grassl, M., Rötteler, M.: Non-catastrophic encoders and encoder inverses for quantum convolutional codes. In: International Symposium on Information Theory (ISIT), Seattle, WA,
USA, 9–14 July 2006
60. Guenda, K.: Quantum duadic and affime invariant codes. Int. J. Quantum Inf. 7, 373–384
(2009)
61. Guenda, K., La Guardia, G.G., Gulliver, T.A.: Algebraic quantum synchronizable codes. J.
Appl. Math. Comput. 55, 393–407 (2017)
62. Hamada, M.: Concatenated quantum codes constructible in polynomial time: efficient decoding and error correction. IEEE Trans. Inf. Theory 54, 5689–5704 (2008)
63. Hocquenghem, A.: Codes correcteurs d’erreurs. Chiffres 2, 147–156 (1959)
64. Hoffman, K., Kunze, R.: Linear Algebra. Prentice-Hall Inc., New Jersey (1971)
65. Hole, K.J.: On classes of convolutional codes that are not asymptotically catastrophic. IEEE
Trans. Inf. Theory 46, 663–669 (2000)
66. Houshmand, M., Hosseini-Khayat, S., Wilde, M.M.: Minimal-memory, non-catastrophic,
polynomial-depth quantum convolutional encoders. IEEE Trans. Inf. Theory 59, 1198–1210
(2013)
67. Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University
Press, Cambridge (2003)
68. Hutchinson, R., Rosenthal, R., Smarandache, R.: Convolutional codes with maximum distance
profile. Syst. Control Lett. 54, 53–63 (2005)
69. Iglesias-Curto, J.I.: Generalized AG convolutional codes. Adv. Math. Commun. 3, 317–328
(2009)