Nearly MDS expander codes with reduced alphabet size - Computer Science > Information TheoryReportar como inadecuado




Nearly MDS expander codes with reduced alphabet size - Computer Science > Information Theory - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: Recently, Roth and Skachek proposed two methods for constructing nearlymaximum-distance separable MDS expander codes. We show that through thesimple modification of using mixed-alphabet codes derived from MDS codes asconstituent codes in their code designs, one can obtain nearly MDS codes ofsignificantly smaller alphabet size, albeit at the expense of a very slightreduction in code rate.



Autor: Marc A. Armand, Jianwen Zhang

Fuente: https://arxiv.org/







Documentos relacionados