Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
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
Document Date: 2011-09-01 06:46:16
Open Document
File Size: 141,32 KB
Share Result on Facebook
UPDATE