June 26, 2024Open Access

Five-Lee-weight linear codes over Fₐ+uFₐ

Puntos clave

Los puntos clave no están disponibles para este artículo en este momento.

Resumen

In this study, linear codes having their Lee-weight distributions over the semi-local ring Fₐ+uFₐ with u^2=1 are constructed using the defining set and Gauss sums for an odd prime q. Moreover, we derive complete Hamming-weight enumerators for the images of the constructed linear codes under the Gray map. We finally show an application to secret sharing schemes.

Leer artículo completoexternamente

Preguntar a la IA

Me gusta

Guardar

Ver artículo completo

Cite This Study

Kumar et al. (Wed,) studied this question.

synapsesocial.com/papers/68e634cdb6db6435875c631f https://doi.org/https://doi.org/10.48550/arxiv.2406.18307

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Optimal linear codes with few weights from simplicial complexes2024
2Linear codes with few weights over $\mathbb{F}_{p}+u\mathbb{F}_{p}$2024
3A family of optimal linear codes of length $2^s$ over the ring $\frac{\mathbb{F}_2[u]}{⟨u^2⟩}$ with Lee distance 42025
4Infinite families of optimal and minimal codes over rings using simplicial complexes2024
5Infinite families of p-ary distance optimal linear codes for odd prime numbers p2025

Preguntar a la IA

Me gusta

Guardar

Ver artículo completo