About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ISIT 1994
Conference paper
Binary codes with large symbols
Abstract
Maximum distance separable (MDS) codes which are defined over larger alphabets require that 1) the encoding and decoding procedures are performed as operations over a finite field, and 2) an update in a single information bit requires an update in the redundancy symbols and usually affects a number of bits in each redundancy symbol. Thus, the optimal redundancy is achieved at the expense of additional complexity in the encoding/decoding procedures as well as the number of redundancy bits affected by an update in the information.