Nearly MDS expander codes with reduced alphabet size

Simple item page
dc.creatorArmand, Marc A.
dc.creatorZhang, Jianwen
dc.date2007-08-08
dc.date.accessioned2026-07-07T08:22:45Z
dc.date.available2026-07-07T08:22:45Z
dc.descriptionRecently, 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.
dc.identifierhttps://arxiv.org/abs/0708.1078
dc.identifierhttp://arxiv.org/abs/0708.1078
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/135760
dc.subjectInformation Theory
dc.titleNearly MDS expander codes with reduced alphabet size
dc.typetext

Files

Collections

arXiv