The Maximum Distance Separable Codes Conjecture Let q = p h , where p is a prime. A k-dimensional linear code C over Fq with minimum distance d and length n is a k-dimensional subspace of Fnq in which every

First Page		Document Content
Date: 2011-09-01 06:46:16		The Maximum Distance Separable Codes Conjecture Let q = p h , where p is a prime. A k-dimensional linear code C over Fq with minimum distance d and length n is a k-dimensional subspace of Fnq in which every Add to Reading List Source URL: www-ma4.upc.es Download Document from Source Website File Size: 141,32 KB Share Document on Facebook