Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Information Theory (ISIT)

The MacWilliams identity for quantum convolutional codes

Ching–Yi Lai, Min-Hsiu Hsieh

Published Jun 1, 2014• 2 citations
Publisher

Abstract

In this paper, we propose a definition of the dual code of a quantum convolutional code, with or without entanglement assistance. We then derive a MacWilliams identity for quantum convolutional codes. Along the way, we obtain a direct proof of the MacWilliams identity, first found by Gluesing-Luerssen and Schneider, in the setting of classical convolutional codes.

DOI
10.1109/isit.2014.6874965

Related papers

On the MacWilliams Identity for Classical and Quantum Convolutional Codes

Ching–Yi Lai, Min-Hsiu Hsieh, Hsiao-Feng Francis Lu

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 WAMs of a systematic convolutional code and its dual. Finally, paralleling the development of the classical case, we establish the MacWilliams identity for quantum CCs.

arXiv:1404.5012•IEEE Transactions on Communications•Jun 28, 2016•17 citations

Quantum MacWilliams Identities

Peter W. Shor, Raymond Laflamme

We derive a relationship between two different notions of fidelity (entanglement fidelity and average fidelity) for a completely depolarizing quantum channel. This relationship gives rise to a quantum analog of the MacWilliams identities in classical coding theory. These identities relate the weight enumerator of a code to the one of its dual and, with linear programming techniques, provided a powerful tool to investigate the possible existence of codes. The same techniques can be adapted to the quantum case. We give examples of their power.

arXiv:quant-ph/9610040•Oct 25, 1996•4 citations

Quantum Analog of the MacWilliams Identities for Classical Coding Theory

Peter W. Shor, Raymond Laflamme

We derive a relationship between two different notions of fidelity (entanglement fidelity and average fidelity) for a completely depolarizing quantum channel. This relationship gives rise to a quantum analog of the MacWilliams identities in classical coding theory. These identities relate the weight enumerator of a code to the one of its dual and, with linear programming techniques, provide a powerful tool to investigate the possible existence of codes. The same techniques can be adapted to the quantum case. We give examples of their power.

Physical Review Letters•Feb 24, 1997•139 citations

Complete Weight Distribution and MacWilliams Identities for Asymmetric Quantum Codes

Chuangqiang Hu, Shudi Yang, Stephen S.‐T. Yau

In 1997, Shor and Laflamme defined the weight enumerators for quantum error-correcting codes and derived a MacWilliams identity. We extend their work by introducing our double weight enumerators and complete weight enumerators. The MacWilliams identities for these enumerators can be obtained similarly. With the help of MacWilliams identities, we obtain various bounds for asymmetric quantum codes.

arXiv:1810.11969•Oct 29, 2018•0 citations

Complete Weight Distributions and MacWilliams Identities for Asymmetric Quantum Codes

Chuangqiang Hu, Shudi Yang, Stephen S.‐T. Yau

In 1997, Shor and Laflamme defined the weight enumerators for quantum error-correcting codes and derived a MacWilliams identity. We extend their work by introducing our double weight enumerators and complete weight enumerators for qubit codes and then investigate the MacWilliams identities for these enumerators. Based on the generalized MacWilliams identities, we solve an open problem, namely, the Singleton-type bound for asymmetric quantum codes (AQCs). Besides, the Hamming-type and the first linear-programming-type bounds for the AQCs are deduced similarly.

IEEE Access•Jan 1, 2019•6 citations

Weight Enumerators of Convolutional Codes, Tail-biting Codes and Their Duals

JØrn Justesen

The weight enumerators of convolutional codes and their tail-biting version may be derived from the finite state description.We present a generating function for the sequence of weight enumerators of these codes, and show that generating functions of dual codes satisfy a MacWilliams identity.The weights of the finite state description of the dual codes may be found by a transform.

•Oct 3, 2001•0 citations
In this paper, we propose a definition of the dual code of a quantum convolutional code, with or without entanglement assistance. We then derive a MacWilliams identity for quantum convolutional codes. Along the way, we obtain a direct proof of the MacWilliams identity, first found by Gluesing-Luerssen and Schneider, in the setting of classical convolutional codes.
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 WAMs of a systematic convolutional code and its dual. Finally, paralleling the development of the classical case, we establish the MacWilliams identity for quantum CCs.
We derive a relationship between two different notions of fidelity (entanglement fidelity and average fidelity) for a completely depolarizing quantum channel. This relationship gives rise to a quantum analog of the MacWilliams identities in classical coding theory. These identities relate the weight enumerator of a code to the one of its dual and, with linear programming techniques, provided a powerful tool to investigate the possible existence of codes. The same techniques can be adapted to the quantum case. We give examples of their power.
We derive a relationship between two different notions of fidelity (entanglement fidelity and average fidelity) for a completely depolarizing quantum channel. This relationship gives rise to a quantum analog of the MacWilliams identities in classical coding theory. These identities relate the weight enumerator of a code to the one of its dual and, with linear programming techniques, provide a powerful tool to investigate the possible existence of codes. The same techniques can be adapted to the quantum case. We give examples of their power.
In 1997, Shor and Laflamme defined the weight enumerators for quantum error-correcting codes and derived a MacWilliams identity. We extend their work by introducing our double weight enumerators and complete weight enumerators for qubit codes and then investigate the MacWilliams identities for these enumerators. Based on the generalized MacWilliams identities, we solve an open problem, namely, the Singleton-type bound for asymmetric quantum codes (AQCs). Besides, the Hamming-type and the first linear-programming-type bounds for the AQCs are deduced similarly.