Abstract
A new class of linear codes over GF(q) for organized systems from algebraic curves is proposed. Here, an element in GF(q) is called a symbol and byte denotes a q-ary sequence of length b/spl ges/2. A codeword in the code is composed of n bytes of byte-length b, thus, the code-length is nb, where N:=nb. These codes have the capability of correcting any error that corrupts both t/sub 1/ bytes and t/sub 2/ symbols within another where t/sub 2/<b. We call such a code a t/sub 1/ and t/sub 2/ symbol error correcting code, or a (t/sub 1/Bt/sub 2/S)EC code. Moreover, we refer to an error that corrupts both t/sub 1/ bytes and t/sub 2/ symbols within another as a t/sub 1/ and t/sub 2/ symbol error.
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.
