An algebraic approach for decoding spread codes

DOI10.3934/AMC.2012.6.443zbMATH Open1282.94105arXiv1107.5523OpenAlexW2026698357MaRDI QIDQ394834FDOQ394834

Authors: Elisa Gorla, Felice Manganiello, Joachim Rosenthal 

Publication date: 28 January 2014

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Abstract: In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size (k x n) with entries in a finite field F_q. Spread codes are a family of optimal codes with maximal minimum distance. We give a minimum-distance decoding algorithm which requires O((n-k)k^3) operations over an extension field F_{q^k}. Our algorithm is more efficient than the previous ones in the literature, when the dimension k of the codewords is small with respect to n. The decoding algorithm takes advantage of the algebraic structure of the code, and it uses original results on minors of a matrix and on the factorization of polynomials over finite fields.

Full work available at URL: https://arxiv.org/abs/1107.5523

Recommendations

• Spread decoding in extension fields
• Partial spreads in random network coding
• Flag codes from planar spreads in network coding
• A Rank-Metric Approach to Error Control in Random Network Coding
• Decoding of random network codes

zbMATH Keywords

decoding algorithmrandom linear network codingspread codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Decoding (94B35)

Cited In (19)

• Optimum distance flag codes from spreads via perfect matchings in graphs
• Equidistant subspace codes
• Partial spreads in random network coding
• Cyclic orbit flag codes
• Flag codes: distance vectors and cardinality bounds
• Spread decoding in extension fields
• On Decoding Algebraic Codes Using Radical Locators
• The complexity of MinRank
• Constant rank-distance sets of Hermitian matrices and partial spreads in Hermitian polar spaces
• A Unified View on Known Algebraic Decoding Algorithms and New Decoding Concepts
• Construction of subspace codes through linkage
• Title not available (Why is that?)
• Galois geometries and coding theory
• Subspace codes from Ferrers diagrams
• The complexity of solving Weil restriction systems
• Message encoding and retrieval for spread and cyclic orbit codes
• Title not available (Why is that?)
• Generic error SDP and generic error CVE
• Flag codes of maximum distance and constructions using Singer groups

This page was built for publication: An algebraic approach for decoding spread codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394834)