Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2511.18250 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914168263671808 |
|---|---|
| author | Huang, Dongmei Liao, Qunying Mesnager, Sihem Tang, Gaohua Yan, Haode |
| author_facet | Huang, Dongmei Liao, Qunying Mesnager, Sihem Tang, Gaohua Yan, Haode |
| contents | Currently known secondary construction techniques for linear codes mainly include puncturing, shortening, and extending. In this paper, we propose a novel method for the secondary construction of linear codes based on their weight functions. Specifically, we develop a general framework that constructs new linear codes from the set of codewords in a given code having a fixed Hamming weight. We analyze the dimension, number of weights, and weight distribution of the constructed codes, and establish connections with the extendability of the original codes as well as the partial weight distribution of the derived codes. As a new tool, this framework enables us to establish an upper bound on the minimum weight of two-weight codes and to characterize all two-weight codes attaining this bound. Moreover, several divisibility properties concerning the parameters of two-weight codes are derived. The proposed method not only generates new families of linear codes but also provides a powerful approach for exploring the intrinsic combinatorial and geometric structures of existing codes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_18250 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the Hamming Weight Functions of Linear Codes Huang, Dongmei Liao, Qunying Mesnager, Sihem Tang, Gaohua Yan, Haode Information Theory Currently known secondary construction techniques for linear codes mainly include puncturing, shortening, and extending. In this paper, we propose a novel method for the secondary construction of linear codes based on their weight functions. Specifically, we develop a general framework that constructs new linear codes from the set of codewords in a given code having a fixed Hamming weight. We analyze the dimension, number of weights, and weight distribution of the constructed codes, and establish connections with the extendability of the original codes as well as the partial weight distribution of the derived codes. As a new tool, this framework enables us to establish an upper bound on the minimum weight of two-weight codes and to characterize all two-weight codes attaining this bound. Moreover, several divisibility properties concerning the parameters of two-weight codes are derived. The proposed method not only generates new families of linear codes but also provides a powerful approach for exploring the intrinsic combinatorial and geometric structures of existing codes. |
| title | On the Hamming Weight Functions of Linear Codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2511.18250 |