Overview
This study investigates the structural and enumerative properties of binary single parity-check (SPC) product codes. It focuses on determining the generalized Hamming weight hierarchy for $\mathcal{C}_{m,n}=\operatorname{SPC}(m)\otimes\operatorname{SPC}(n)$, where $\operatorname{SPC}(n)$ represents the binary single parity-check code of length $n$. For the specific case of the square product code, $\mathcal{C}_n =\operatorname{SPC}(n)\otimes\operatorname{SPC}(n)$, the research ascertains the maximum codeword weight and identifies the condition under which its homogeneous weight enumerator is symmetric. Furthermore, the study characterizes the dual code and leverages the MacWilliams identity, formulated as a Walsh–Hadamard transform, to derive an exact closed-form expression for the weight enumerator. The methodology involves grouping auxiliary binary vectors by their Hamming weights to yield an explicit formula for each coefficient, expressed in terms of binomial coefficients and alternating convolutions. Finally, an exact procedure is presented for computing the complete weight distribution using Krawtchouk polynomials, aiming to avoid exhaustive codeword enumeration.
Research Context
The research is situated within the study of error-correcting codes, specifically focusing on single parity-check product codes. The binary single parity-check code, $\operatorname{SPC}(n)$, is defined for each $n\geq 2$ as the set of all binary vectors of length $n$ that possess an even Hamming weight. The product code $\mathcal{C}_{m,n}=\operatorname{SPC}(m)\otimes\operatorname{SPC}(n)$ is described by codewords that can be conceptualized as $m\times n$ binary matrices, where a defining characteristic is that every row and every column within these matrices must have an even Hamming weight. This foundational definition underpins the subsequent analysis of their weight distributions and structural properties.
Approach
The investigation employs a multi-faceted approach to characterize the weight distributions of the codes:
- Generalized Hamming Weight Hierarchy: The study determines the generalized Hamming weight hierarchy for the product code $\mathcal{C}_{m,n}=\operatorname{SPC}(m)\otimes\operatorname{SPC}(n)$.
- Maximum Codeword Weight: For the square product code, $\mathcal{C}_n =\operatorname{SPC}(n)\otimes\operatorname{SPC}(n)$, the research identifies its maximum codeword weight.
- Symmetry Condition: It also establishes the condition for the homogeneous weight enumerator of $\mathcal{C}_n$ to be symmetric, specifically proving this occurs if and only if $n$ is an even number.
- Dual Code Characterization: The dual code associated with these product codes is characterized as part of the analysis.
- Weight Enumerator Derivation: The MacWilliams identity, expressed in its Walsh–Hadamard formulation, is applied to obtain an exact closed-form expression for the weight enumerator.
- Coefficient Calculation: Auxiliary binary vectors are grouped according to their Hamming weights, which facilitates the derivation of an explicit formula for each coefficient within the weight enumerator. These coefficients are expressed using binomial coefficients and alternating convolutions.
- Full Weight Distribution Computation: Krawtchouk polynomials are utilized to outline an exact procedure for computing the full weight distribution. This method is presented as an alternative to exhaustively enumerating all codewords.
Numerical examples are used to illustrate the derived formulas and to verify the computational results.
Findings
- The generalized Hamming weight hierarchy for the product code $\mathcal{C}_{m,n}=\operatorname{SPC}(m)\otimes\operatorname{SPC}(n)$ was determined.
- For the square product $\mathcal{C}_n =\operatorname{SPC}(n)\otimes\operatorname{SPC}(n)$, the maximum codeword weight was determined.
- The homogeneous weight enumerator of $\mathcal{C}_n$ is symmetric if and only if $n$ is even.
- The dual code was characterized.
- An exact closed-form expression for the weight enumerator was derived using the MacWilliams identity in its Walsh–Hadamard formulation.
- An explicit formula for each coefficient of the weight enumerator was obtained in terms of binomial coefficients and alternating convolutions, by grouping auxiliary binary vectors based on their Hamming weights.
- An exact procedure for computing the full weight distribution, without exhaustively enumerating all codewords, was presented using Krawtchouk polynomials.