World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

On the generalized Hamming weights of hyperbolic codes

    https://doi.org/10.1142/S0219498825500628Cited by:0 (Source: Crossref)
    This article is part of the issue:

    A hyperbolic code is an evaluation code that improves a Reed–Muller code because the dimension increases while the minimum distance is not penalized. We give necessary and sufficient conditions, based on the basic parameters of the Reed–Muller code, to determine whether a Reed–Muller code coincides with a hyperbolic code. Given a hyperbolic code 𝒞C, we find the largest Reed–Muller code contained in 𝒞C and the smallest Reed–Muller code containing 𝒞C. We then prove that similar to Reed–Muller and affine Cartesian codes, the rrth generalized Hamming weight and the rrth footprint of the hyperbolic code coincide. Unlike for Reed–Muller and affine Cartesian codes, determining the rrth footprint of a hyperbolic code is still an open problem. We give upper and lower bounds for the rrth footprint of a hyperbolic code that, sometimes, are sharp.

    Communicated by E. Gorla

    Dedicated to Joachim Rosenthal on the occasion of his 60th birthday. We thank Prof. Rosenthal for his selfless, continuous, and endless support to shape the coding theory and cryptography community.

    AMSC: 94B05, 13P25, 14G50, 11T71