Abstract
In this paper, we present a fractional decoding algorithm for a new family of codes which are constructed from the Hermitian curve, called r-Hermitian codes. These codes of length n are defined over an extension field Fq2l of Fq2 and the fractional decoding algorithms that we present are algorithms for error correction that use only αln symbols of a subfield of size q2 as input into the decoding algorithm, where α<1, meaning a fraction of the subsymbols that are typically utilized. We demonstrate that collaborative decoding of interleaved codes supports fractional decoding of the r-Hermitian codes, allowing for improved bounds on the fractional decoding radius.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
