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.
Conference paper
Unordered error-correcting codes and their applications
Abstract
The authors give efficient constructions for error correcting unordered codes, i.e., codes such that any two codewords are at a certain minimal distance apart and at the same time they are unordered. They present three constructions together with tables that compare their efficiencies. These codes are used for detecting a predetermined number of symmetric errors and for detecting all unidirectional errors. An application to parallel asynchronous communications is included.
Related
Conference paper
On codes for structured bursts
Conference paper