Please use this identifier to cite or link to this item: https://doi.org/10.1109/CIG.2010.5592857
Title: On encoders for quantum convolutional codes
Authors: Grassl, M. 
Rotteler, M.
Issue Date: 2010
Source: Grassl, M.,Rotteler, M. (2010). On encoders for quantum convolutional codes. 2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings : -. ScholarBank@NUS Repository. https://doi.org/10.1109/CIG.2010.5592857
Abstract: We consider the problem of computing an encoding circuit for a quantum convolutional code given by a polynomial stabilizer matrix S(D)=(X(D) | Z(D)). We present an algorithm that is very similar to a polynomial-time algorithm for computing the Smith form of a polynomial matrix. This is a step towards the conjecture that any quantum convolutional code has an encoder with polynomially bounded depth. © 2010 IEEE.
Source Title: 2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings
URI: http://scholarbank.nus.edu.sg/handle/10635/116764
ISBN: 9781424482641
DOI: 10.1109/CIG.2010.5592857
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

1
checked on Feb 12, 2018

Page view(s)

21
checked on Feb 15, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.