Spread Codes from Abelian non-cyclic groups
Joan-Josep Climent, Veronica Requena, Xaro Soler-Escriv\`a

TL;DR
This paper introduces a novel method for constructing spreads in finite vector spaces using Abelian non-cyclic groups, resulting in orbit codes with maximum distance and complete spreads with orbital structure.
Contribution
It presents a new approach to constructing spreads via Abelian non-cyclic groups, including maximum distance orbit codes and complete spreads with orbital structure.
Findings
Constructed a family of maximum distance orbit codes.
Achieved complete spreads with orbital structure.
Provided a new algebraic framework for spreads in finite fields.
Abstract
Given the finite field , for a prime power , in this paper we present a way of constructing spreads of . They will arise as orbits under the action of an Abelian non-cyclic group. First, we construct a family of orbit codes of maximum distance using this group, and then we complete each of these codes to achieve a spread of the whole space having an orbital structure.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · DNA and Biological Computing · Coding theory and cryptography
