• español
  • English
  • français
  • Deutsch
  • português (Brasil)
  • italiano
    • español
    • English
    • français
    • Deutsch
    • português (Brasil)
    • italiano
    • español
    • English
    • français
    • Deutsch
    • português (Brasil)
    • italiano
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of UVaDOCCommunitiesBy Issue DateAuthorsSubjectsTitles

    My Account

    Login

    Statistics

    View Usage Statistics

    Share

    View Item 
    •   UVaDOC Home
    • SCIENTIFIC PRODUCTION
    • Departamentos
    • Dpto. Álgebra, Análisis Matemático, Geometría y Topología
    • DEP96 - Comunicaciones a congresos, conferencias, etc.
    • View Item
    •   UVaDOC Home
    • SCIENTIFIC PRODUCTION
    • Departamentos
    • Dpto. Álgebra, Análisis Matemático, Geometría y Topología
    • DEP96 - Comunicaciones a congresos, conferencias, etc.
    • View Item
    • español
    • English
    • français
    • Deutsch
    • português (Brasil)
    • italiano

    Export

    RISMendeleyRefworksZotero
    • edm
    • marc
    • xoai
    • qdc
    • ore
    • ese
    • dim
    • uketd_dc
    • oai_dc
    • etdms
    • rdf
    • mods
    • mets
    • didl
    • premis

    Citas

    Por favor, use este identificador para citar o enlazar este ítem:http://uvadoc.uva.es/handle/10324/40152

    Título
    Accelerated Processing for Maximum Distance Separable Codes using Composite Extension Fields
    Autor
    Ruano Benito, DiegoAutoridad UVA Orcid
    Lucani, Daniel E.
    Geil, Olav
    Congreso
    European Wireless 2019; 25th European Wireless Conference. Aarhus, Denmark
    Año del Documento
    2019
    Editorial
    VDE
    Descripción Física
    5 p.
    Abstract
    This paper describes a new design of Reed-Solomon (RS) codes when using composite extension fields. Our ultimate goal is to provide codes that remain Maximum Distance Separable (MDS), but that can be processed at higher speeds in the encoder and decoder. This is possible by using coefficients in the generator matrix that belong to smaller (and faster) finite fields of the composite extension and limiting the use of the larger (and slower) finite fields to a minimum. We provide formulae and an algorithm to generate such constructions starting from a Vandermonde RS generator matrix and show that even the simplest constructions, e.g., using only processing in two finite fields, can speed up processing by as much as two-fold compared to a Vandermonde RS and Cauchy RS while using the same decoding algorithm, and more than two-fold compared to other RS Cauchy and FFT-based RS.
    ISBN
    978-3-8007-4948-5
    Version del Editor
    https://ieeexplore.ieee.org/document/8835932
    Idioma
    eng
    URI
    http://uvadoc.uva.es/handle/10324/40152
    Tipo de versión
    info:eu-repo/semantics/draft
    Derechos
    openAccess
    Collections
    • DEP96 - Comunicaciones a congresos, conferencias, etc. [1]
    Show full item record
    Files in this item
    Nombre:
    EWC2019eprint.pdf
    Tamaño:
    249.1Kb
    Formato:
    Adobe PDF
    Thumbnail
    FilesOpen
    Attribution-NonCommercial-NoDerivatives 4.0 InternacionalExcept where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 Internacional

    Comentarios

    Universidad de Valladolid

    Powered by MIT's. DSpace software, Version 5.10