2000 character limit reached
Spread Codes from Abelian non-cyclic groups
Published 28 Jan 2025 in cs.IT and math.IT | (2501.16838v1)
Abstract: Given the finite field $\mathbb{F}{q}$, for a prime power $q$, in this paper we present a way of constructing spreads of $\mathbb{F}{q}{n}$. 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.