Function-Correcting Codes for Linear and Locally Bounded Functions Over a Finite Chain Ring
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911518102126592 |
|---|---|
| author | Verma, Gyanendra K. Singh, Abhay Kumar |
| author_facet | Verma, Gyanendra K. Singh, Abhay Kumar |
| contents | In this paper, we further extend the study of function-correcting codes in the homogeneous metric over a chain ring $\mathbb{Z}_{2^s}$ for broader classes of functions, namely, locally bounded functions and linear functions, and for weight functions, modular sum functions. e define locally bounded functions in the homogeneous metric over $\mathbb{Z}_{2^s}^k$ and investigate the locality of weight functions. We derive a Plotkin-like bound for irregular homogeneous distance code over $\mathbb{Z}_4$, which improves the existing bound. Using locality properties of functions, we establish upper and lower bounds on the optimal redundancy. We provide several explicit constructions of function-correcting codes for locally bounded functions, weight functions, and weight distribution functions. Using these constructions, we further discuss the tightness of the derived bound. We explicitly derive a Plotkin-like bound for linear function-correcting codes that reduces to the classical Plotkin bound when the linear function is bijective, we further discuss a construction of function-correcting linear codes over $\mathbb{Z}_{2^s}$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_14471 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Function-Correcting Codes for Linear and Locally Bounded Functions Over a Finite Chain Ring Verma, Gyanendra K. Singh, Abhay Kumar Information Theory In this paper, we further extend the study of function-correcting codes in the homogeneous metric over a chain ring $\mathbb{Z}_{2^s}$ for broader classes of functions, namely, locally bounded functions and linear functions, and for weight functions, modular sum functions. e define locally bounded functions in the homogeneous metric over $\mathbb{Z}_{2^s}^k$ and investigate the locality of weight functions. We derive a Plotkin-like bound for irregular homogeneous distance code over $\mathbb{Z}_4$, which improves the existing bound. Using locality properties of functions, we establish upper and lower bounds on the optimal redundancy. We provide several explicit constructions of function-correcting codes for locally bounded functions, weight functions, and weight distribution functions. Using these constructions, we further discuss the tightness of the derived bound. We explicitly derive a Plotkin-like bound for linear function-correcting codes that reduces to the classical Plotkin bound when the linear function is bijective, we further discuss a construction of function-correcting linear codes over $\mathbb{Z}_{2^s}$. |
| title | Function-Correcting Codes for Linear and Locally Bounded Functions Over a Finite Chain Ring |
| topic | Information Theory |
| url | https://arxiv.org/abs/2603.14471 |