On the MacWilliams Identity for Classical and Quantum Convolutional Codes
arXiv:1404.5012 · doi:10.1109/TCOMM.2016.2585641
Abstract
The weight generating functions associated with convolutional codes (CCs) are based on state space realizations or the weight adjacency matrices (WAMs). The MacWilliams identity for CCs on the WAMs was first established by Gluesing- Luerssen and Schneider in the case of minimal encoders, and generalized by Forney. We consider this problem in the viewpoint of constraint codes and obtain a simple and direct proof of this MacWilliams identity in the case of minimal encoders. For our purpose, we choose a different representation for the exact weight generating function (EWGF) of a block code, by defining it as a linear combination of orthonormal vectors in Dirac bra-ket notation. This representation provides great flexibility so that general split weight generating functions and their MacWilliams identities can be easily obtained from the MacWilliams identity for EWGFs. As a result, we also obtain the MacWilliams identity for the input-parity weight adjacency matrices of a systematic convolutional code and its dual. Finally, paralleling the development of the classical case, we establish the MacWilliams identity for quantum convolutional codes.
arXiv commentPart of this work was in Proceedings of IEEE Intl. Symp. Inf. Theory 2014, and part of this work was in Proceedings of IEEE Information Theory Workshop 2014. 11 pages, 4 figures
References in corpus (20)
- Good Quantum Error-Correcting Codes Exist
- Multiple Particle Interference and Quantum Error Correction
- Stabilizer Codes and Quantum Error Correction
- Correcting Quantum Errors with Entanglement
- General entanglement-assisted quantum error-correcting codes
- Catalytic quantum error correction
- Description of a quantum convolutional code
- Convolutional and tail-biting quantum error-correcting codes
- Entanglement-assisted quantum turbo codes
- Entanglement Increases the Error-Correcting Ability of Quantum Error-Correcting Codes
- Duality in Entanglement-Assisted Quantum Error Correction
- Entanglement-Assisted Quantum Error-Correcting Codes with Imperfect Ebits
- Entanglement-Assisted Quantum Convolutional Coding
- Normal Factor Graphs and Holographic Transformations
- Non-catastrophic Encoders and Encoder Inverses for Quantum Convolutional Codes
- Classical Enhancement of Quantum Error-Correcting Codes
- Constructions of Quantum Convolutional Codes
- Quantum Shift Register Circuits
- Extra Shared Entanglement Reduces Memory Demand in Quantum Convolutional Coding
- Quantum Weight Enumerators
Cited by in corpus (5)
- Linear Programming Bounds for Entanglement-Assisted Quantum Error-Correcting Codes by Split Weight Enumerators
- Linear programming bounds for quantum channels acting on quantum error-correcting codes
- Linear programming bounds for quantum amplitude damping codes
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra
- Construction and Performance of Quantum Burst Error Correction Codes for Correlated Errors