A Caltech Library Service

The partition weight enumerator of MDS codes and its applications

El-Khamy, Mostafa and McEliece, Robert J. (2005) The partition weight enumerator of MDS codes and its applications. In: 2005 IEEE International Symposium on Information Theory (ISIT) : Adelaide, Australia, 4-9 September, 2005. IEEE , Piscataway, NJ, pp. 926-930. ISBN 0-7803-9151-9.

PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


A 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.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© 2005 IEEE. Reprinted with permission. This research was supported by NSF grant no. CCR-0118670 and grants from Sony, Qualcomm, and the Lee Center for Advanced Networking.
Funding AgencyGrant Number
Caltech Lee Center for Advanced NetworkingUNSPECIFIED
Record Number:CaltechAUTHORS:ELKisit05
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:3535
Deposited By: Archive Administrator
Deposited On:13 Jun 2006
Last Modified:02 Oct 2019 23:04

Repository Staff Only: item control page