The authors study a type of code over R = Z₂ + uZ₂ + u²Z₂ (u³ = 0). They look at different ways to measure code weights—like Hamming and Lee—and show how these relate to the code’s dual using MacWilliams identities: doi.org/10.1142/S179...
#CodingTheory #LinearCodes
#CodingTheory #LinearCodes
June 10, 2026 at 5:23 AM
The authors study a type of code over R = Z₂ + uZ₂ + u²Z₂ (u³ = 0). They look at different ways to measure code weights—like Hamming and Lee—and show how these relate to the code’s dual using MacWilliams identities: doi.org/10.1142/S179...
#CodingTheory #LinearCodes
#CodingTheory #LinearCodes
The authors compare two constructions over F₂ (Chang & Hyun vs Wu & Lee), explore their relationships, and derive self-orthogonal codes with generalized Hamming weights: doi.org/10.1142/S179...
#CodingTheory #LinearCodes
#CodingTheory #LinearCodes
June 10, 2026 at 3:44 AM
The authors compare two constructions over F₂ (Chang & Hyun vs Wu & Lee), explore their relationships, and derive self-orthogonal codes with generalized Hamming weights: doi.org/10.1142/S179...
#CodingTheory #LinearCodes
#CodingTheory #LinearCodes