An algebraic approach for decoding spread codes

DOI10.3934/AMC.2012.6.443MaRDI QIDQ394834zbMATH OpenOpenAlexFDO

Authors Elisa Gorla, Felice Manganiello, Joachim Rosenthal

Publication date 28 January 2014

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

decoding algorithmrandom linear network codingspread codes

Mathematics Subject Classification ID

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

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.

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

Cited in

(19)

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

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)