8 papers · 1 filter
Construction of cyclic codes with large minimum distance from power functions over odd characteristic finite fields
Mrinal Kanti Bose, Abhay Kumar Singh
Cyclic codes with dimensions exceeding half of the code length and minimum distance greater than the square root of the code length are of significant interest due to their high tr…
Function-Correcting Codes for Linear and Locally Bounded Functions Over a Finite Chain Ring
Gyanendra K. Verma, Abhay Kumar Singh
In this paper, we further extend the study of function-correcting codes in the homogeneous metric over a chain ring for broader classes of functions, namely, loc…
On Function-Correcting Codes in the Lee Metric
Gyanendra K. Verma, Abhay Kumar Singh
Function-correcting codes are a coding framework designed to minimize redundancy while ensuring that specific functions or computations of encoded data can be reliably recovered, e…
Function-Correcting -symbol Codes for Locally -Functions
Gyanendra K. Verma, Anamika Singh, Abhay Kumar Singh
The family of functions plays a central role in the design and effectiveness of function-correcting codes. By focusing on a well-defined family of functions, function-correcting co…
Code size constraints in b-symbol read channels: A bound analysis
Gyanendra K. Verma, Nupur Patanker, Abhay Kumar Singh
In classical coding theory, error-correcting codes are designed to protect against errors occurring at individual symbol positions in a codeword. However, in practical storage and…
Binary cyclic codes from permutation polynomials over
Mrinal Kanti Bose, Udaya Parampalli, Abhay Kumar Singh
Binary cyclic codes having large dimensions and minimum distances close to the square-root bound are highly valuable in applications where high-rate transmission and robust error c…