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

JØrn Justesen

Published Oct 3, 2001• 0 citations

Abstract

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.

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.5012IEEE Transactions on CommunicationsJun 28, 201617 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.11969Oct 29, 20180 citations

A Multivariate Weight Enumerator for Tail-biting Trellis Pseudocodewords

Nigel Boston

Tail-biting-trellis representations of codes allow for iterative decoding algorithms, which are limited in effectiveness by the presence of pseudocodewords. We introduce a multivariate weight enumerator that keeps track of these pseudocodewords. This enumerator is invariant under many linear transformations, often enabling us to compute it exactly. The extended binary Golay code has a particularly nice tail-biting-trellis and a famous unsolved question is to determine its minimal AWGN pseudodistance. The new enumerator provides an inroad to this problem.

Journal of Generalized Lie Theory and ApplicationsJan 1, 20157 citations

Twisted Fourier Analysis of Quantum Weight Enumerators

Ching-Yi Lai

A unified Fourier framework for quantum weight enumerators of prime-power-dimensional qudits is developed in this paper. We introduce the notions of Weyl power spectrum and Weyl-conjugation autocorrelation for the Weyl-operator quantities nderlying the Shor--Laflamme weight enumerators. Representing these quantities as formal vectors, we show that they form a symplectic Fourier transform pair, from which the quantum MacWilliams identity follows by applying the Hamming-weight functional. This framework extends to a family of twisted Fourier transforms, including the Rains shadow transform. We show that identical-copy Bell sampling corresponds to a twisted autocorrelation related to the shadow enumerator through Weyl translation and Hamming projection. We further prove that all twisted Fourier transforms are Weyl translations of either the ordinary MacWilliams transform or the Rains shadow transform. This two-class reduction implies that the twists yield no additional independent coefficientwise positivity constraints under compatible projections. Nevertheless, the framework leads to refined MacWilliams and shadow identities that retain more Fourier information than ordinary Hamming weight enumerators. We employ these refined identities in linear programming, together with simplex mapping and shadow-coset counting, to exclude surviving candidate weight distributions. These techniques yield tighter bounds for binary and qutrit quantum codes, including nonexistence results for specific code parameters.

quant-pharXiv:2610.37894Oct 29, 20260 citations

The MacWilliams identity for quantum convolutional codes

Ching–Yi Lai, Min-Hsiu Hsieh

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.

IEEE International Symposium on Information Theory (ISIT)Jun 1, 20142 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 AccessJan 1, 20196 citations