Maximum distance separable codes

Albanell Sarroca, Elisabeth

View/Open

memoria.pdf (745,6Kb)

View UPCommons Usage Statistics

LA Referencia / Recolecta stats

Cita com:

Show full item record

Albanell Sarroca, Elisabeth

Tutor / directorBall, Simeon Michael

Document typeBachelor thesis

Date2014-10

Rights accessOpen Access

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder

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.

SubjectsError-correcting codes (Information theory), Codis de correcció d'errors (Teoria de la informació)

DegreeGRAU EN MATEMÀTIQUES (Pla 2009)

URIhttp://hdl.handle.net/2099.1/23910

Collections

Facultat de Matemàtiques i Estadística - Grau en Matemàtiques (Pla 2009) [325]

View UPCommons Usage Statistics

Show full item record

Files	Description	Size	Format	View
memoria.pdf		745,6Kb	PDF	View/Open

UPCommons. Global access to UPC knowledge

Maximum distance separable codes

View/Open

Browse