Nearly MDS expander codes with reduced alphabet size

Details Nearly MDS expander codes with reduced alphabet size Nearly MDS expander codes with reduced alphabet size

2007-08-08

arxiv.org/abs/0708.1078v1

Computer Science

Information Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Nearly MDS expander codes with reduced alphabet size does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Nearly MDS expander codes with reduced alphabet size, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nearly MDS expander codes with reduced alphabet size will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-215631