J. Comput. Appl. Math.

Paper

15 Mar 2016

On multiple burst-correcting MDS codes

View publication

Abstract

It is well known that binary random error-correcting MDS codes are trivial. However, the same is not true for burst-correcting codes. We present properties of MDS codes for multiple burst-correcting codes over the binary field generalizing those of random error correcting codes.

Related

Conference paper

Use of Gray codes for optimizing the search of (shortened) cyclic single burst-correcting codes

Luis Javier García Villalba, José René Fuentes Cortez, et al.

ISIT 2011

Conference paper

Use of Gray codes for optimizing the search of (shortened) cyclic single burst-correcting codes

Luis Javier García Villalba, José René Fuentes Cortez, et al.

ISIT 2011

Paper

Coding for tolerance and detection of skew in parallel asynchronous communications

Mario Blaum, Jehoshua Brück

IEEE Trans. Inf. Theory

Conference paper

Enumerative encoding with non-uniform modulation constraints

Mario Blaum, Roy D. Cideciyan, et al.

ISIT 2007

View all publications