Nearly MDS expander codes with reduced alphabet size
Information Theory
2007-08-09 v1 math.IT
Abstract
Recently, Roth and Skachek proposed two methods for constructing nearly maximum-distance separable (MDS) expander codes. We show that through the simple modification of using mixed-alphabet codes derived from MDS codes as constituent codes in their code designs, one can obtain nearly MDS codes of significantly smaller alphabet size, albeit at the expense of a (very slight) reduction in code rate.
Cite
@article{arxiv.0708.1078,
title = {Nearly MDS expander codes with reduced alphabet size},
author = {Marc A. Armand and Jianwen Zhang},
journal= {arXiv preprint arXiv:0708.1078},
year = {2007}
}