Abstract
In this letter it is proved that five times extended Reed-Solomon codes contain an infinite subset of almost MDS codes with parameters: $[(q-1)+5,(q-1),5]_{GF(2^m)}$[(q-1)+5,(q-1),5]GF(2m) which are defined over a finite field $GF(2^m)$GF(2m) where $m\geq 3$m≥3 is a positive odd integer. The first three of these codes reach an upper bound for linear block code distance for the corresponding codeword lengths and number of information symbols in codewords in existing tables for optimal code parameters [1] . The relevant parts of weight spectra for the first four codes confirm the code parameters.
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.
