Abstract
Let S consist of all words of a code C for which each symbol is in a stipulated subalphabet, possibly different for distinct positions. We consider the special case where C is a linear maximum-distance separable (MDS) code, and the subalphabets are linear subspaces over the ground field with equal dimensions. We give an explicit algorithm for selecting the subspaces in such a way that a straightforward systematic encoding algorithm, based on an encoder for C, can be applied. The number of information symbols that can be encoded with this algorithm equals a well-known lower bound on the dimension of S.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.