Spread decoding in extension fields
| Autor: | Felice Manganiello, Anna-Lena Trautmann |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
FOS: Computer and information sciences
Discrete mathematics Algebra and Number Theory Computer Science - Information Theory Information Theory (cs.IT) Applied Mathematics Concatenated error correction code General Engineering Code word List decoding 020206 networking & telecommunications 0102 computer and information sciences 02 engineering and technology Sequential decoding 01 natural sciences Linear code Theoretical Computer Science Dimension (vector space) 010201 computation theory & mathematics 0202 electrical engineering electronic engineering information engineering Standard array Decoding methods Computer Science::Information Theory Mathematics |
| Zdroj: | Finite Fields and Their Applications |
| ISSN: | 1071-5797 |
| DOI: | 10.1016/j.ffa.2013.08.002 |
| Popis: | A spread code is a set of vector spaces of a fixed dimension over a finite field Fq with certain properties used for random network coding. It can be constructed in different ways which lead to different decoding algorithms. In this work we present a new representation of spread codes with a minimum distance decoding algorithm which is efficient when the codewords, the received space and the error space have small dimension. Comment: Submitted for publication to Finite Fields and their Applications (Elsevier) |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect