Riemann-Roch Theorem and Mac Williams identities for an additive code with respect to a saturated lattice | IEEE Conference Publication | IEEE Xplore

Riemann-Roch Theorem and Mac Williams identities for an additive code with respect to a saturated lattice


Abstract:

Let (G, +) be a finite abelian group and (C, +)<; (Gn, +) be an additive code with dual (C⊥,.) <; (Gn, + .). Consider a lattice (L, ∩, +) of subgroups of (Gn, +) and its ...Show More

Abstract:

Let (G, +) be a finite abelian group and (C, +)<; (Gn, +) be an additive code with dual (C,.) <; (Gn, + .). Consider a lattice (L, ∩, +) of subgroups of (Gn, +) and its dual lattice (L, ., ∩) of subgroups of the character variety (Gn, .). We say that L and L are saturated if their unique elements of maximal order are Gn ∈ L, respectively, G ∈ L. The present note generalizes Randriambololona's Riemann-Roch Theorem for sections of Fq-linear codes C ⊂ Fnq with values in subspaces of Fnq to L-valued sections of C and L-valued sections of C. That provides natural Mac Williams identities for C, C with respect to saturated L, L. If C ⊂ Fnq is an Fq-linear code and (H, ∩, +) is the Hamming lattice of the coordinate subspaces of Fnq, our Mac Williams identities reduce to the classical ones.
Date of Conference: 11-17 October 2020
Date Added to IEEE Xplore: 25 March 2021
ISBN Information:
Conference Location: Albena, Bulgaria

Funding Agency:


Contact IEEE to Subscribe

References

References is not available for this document.