The Partition Weight Enumerator of MDS Codes and its Applications

Simple item page
dc.creatorEl-Khamy, Mostafa
dc.creatorMcEliece, Robert J.
dc.date2005-05-21
dc.date.accessioned2026-07-07T08:17:47Z
dc.date.available2026-07-07T08:17:47Z
dc.descriptionA closed form formula of the partition weight enumerator of maximum distance separable (MDS) codes is derived for an arbitrary number of partitions. Using this result, some properties of MDS codes are discussed. The results are extended for the average binary image of MDS codes in finite fields of characteristic two. As an application, we study the multiuser error probability of Reed Solomon codes.
dc.descriptionThis is a five page conference version of the paper which was accepted by ISIT 2005. For more information, please contact the authors
dc.identifierhttps://arxiv.org/abs/cs/0505054
dc.identifierhttp://arxiv.org/abs/cs/0505054
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134212
dc.subjectInformation Theory
dc.subjectE.4
dc.titleThe Partition Weight Enumerator of MDS Codes and its Applications
dc.typetext

Files

Collections

arXiv