An algebraic approach for decoding spread codes

DOI10.3934/amc.2012.6.443zbMath1282.94105arXiv1107.5523OpenAlexW2026698357MaRDI QIDQ394834

Felice Manganiello, Elisa Gorla, Joachim Rosenthal

Publication date: 28 January 2014

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

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)

Related Items

Flag codes of maximum distance and constructions using Singer groups, Optimum distance flag codes from spreads via perfect matchings in graphs, The Complexity of MinRank, Partial spreads in random network coding, Construction of subspace codes through linkage, Constant rank-distance sets of Hermitian matrices and partial spreads in Hermitian polar spaces, Equidistant subspace codes, Message encoding and retrieval for spread and cyclic orbit codes, The complexity of solving Weil restriction systems, Galois geometries and coding theory, Spread decoding in extension fields, Cyclic orbit flag codes, Flag codes: distance vectors and cardinality bounds, Subspace codes from Ferrers diagrams