Processing math: 100%
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.

Characterization of some specific lee distance codes over finite rings

    https://doi.org/10.1142/S1793830924500241Cited by:0 (Source: Crossref)

    Codes over integer rings equipped with the Lee metric are gaining attention among researchers recently. In this paper, we investigate some specific linear codes over integer rings and characterize their dimensions and Lee weights using greatest common divisors (GCD). Furthermore, we construct equidistant Lee codes over 2b,2pandp which have applications in error detection and error correction.

    Communicated by Suogang Gao

    AMSC: 94B05