Title:
|
Maximum distance separable codes
|
Author:
|
Albanell Sarroca, Elisabeth
|
Other authors:
|
Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV; Ball, Simeon Michael |
Abstract:
|
The focus of this bachelor thesis are maximum distance separable codes. A code is used to communicate over noise channel so any interferences that may occur can be detected and corrected. Maximum distance separable codes have a capacity to correct many errors. Maximum distances separable codes are usually constructed as linear codes over fields but in this text we will also consider them over certain commutative rings. Recently it has been proven that all linear maximum distance separable codes over prime fields are short and we will prove that this carries over to certain linear maximum distance separable codes over p-adic rings. |
Subject(s):
|
-Àrees temàtiques de la UPC::Matemàtiques i estadística -Error-correcting codes (Information theory) -Linear codes -Singleton bound -P-adic linear codes -MDS codes -Codis de correcció d'errors (Teoria de la informació) -Classificació AMS::94 Information And Communication, Circuits::94B Theory of error-correcting codes and error-detecting codes |
Rights:
|
|
Document type:
|
Bachelor Thesis |
Published by:
|
Universitat Politècnica de Catalunya
|
Share:
|
|