Loading...
Please wait, while we are loading the content...
Similar Documents
The upper bound of general Maximum Distance Separable codes
| Content Provider | Semantic Scholar |
|---|---|
| Author | John, Saint Huntemann, Svenja |
| Copyright Year | 2012 |
| Abstract | A maximum distance separable (MDS) code has q codewords of length n over an alphabet of size q and meets the singleton bound for block codes, therefore the minimum (Hamming) distance of the code is given by d = n− k + 1. The main research problem is finding the maximum possible length n if the alphabet size q and the dimension k are fixed. For linear MDS codes, we give a summary of the current state of the research. For the general, not necessarily linear, case an extensive list of the known upper bounds is given, and we investigate using the partition weight enumerator as a technique to improve the upper bounds. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://mathstat.dal.ca/~svenjah/HonoursThesis.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
