Function-Correcting Codes for Linear and Locally Bounded Functions Over a Finite Chain Ring

Abstract

In this paper, we further extend the study of function-correcting codes in the homogeneous metric over a chain ring Z2s 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 Z2sk and investigate the locality of weight functions. We derive a Plotkin-like bound for irregular homogeneous distance code over Z4, 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 Z2s.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…