pith. sign in

arxiv: 0708.1078 · v1 · submitted 2007-08-08 · 💻 cs.IT · math.IT

Nearly MDS expander codes with reduced alphabet size

classification 💻 cs.IT math.IT
keywords codesnearlyalphabetcodeexpandersizealbeitconstituent
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.