Orbit codes from forms on vector spaces over a finite field
DOI10.3934/AMC.2020105zbMATH Open1497.94175OpenAlexW3071847929MaRDI QIDQ2070263FDOQ2070263
Authors: Angela Aguglia, Giuseppe Marino, Francesco Pavese, Alessandro Siciliano, Antonio Cossidente 
Publication date: 24 January 2022
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2020105
Recommendations
Combinatorial aspects of finite geometries (05B25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Quadratic and bilinear forms, inner products (15A63) Combinatorial codes (94B25)
Cites Work
- Network information flow
- Cyclic Orbit Codes
- Endliche Gruppen I
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Johnson type bounds on constant dimension codes
- External flats to varieties in \(\mathbb{P}\mathbb{G}(M_{n,n}(GF(q)))\)
- Linearized polynomials over finite fields revisited
- Existence of \(q\)-analogs of Steiner systems
- A Random Linear Network Coding Approach to Multicast
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Error-Correcting Codes in Projective Space
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
- Linear groups containing a Singer cycle
- Isometry and automorphisms of constant dimension codes
- Cyclic orbit codes and stabilizer subfields
- Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks
- Codes and Designs Related to Lifted MRD Codes
- Construction of subspace codes through linkage
- Veronese subspace codes
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- On subspace codes
- The cyclic model for \(PG(n,q)\) and a construction of arcs
- Title not available (Why is that?)
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
- Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
- Subspace Polynomials and Cyclic Subspace Codes
- Finite projective geometries that are incidence structures of caps
- Subspace codes in \(\operatorname{PG}(2N-1; q)\)
- Message encoding and retrieval for spread and cyclic orbit codes
- Constructions of cyclic constant dimension codes
- Cyclic subspace codes via subspace polynomials
- A construction of abelian non-cyclic orbit codes
- Puncturing maximum rank distance codes
- Optimal subspace codes in \(\mathrm{PG}(4,q) \)
- Product of symplectic groups and its cyclic orbit code
- Combining subspace codes
Cited In (9)
- On the spectrum of orbit codes in the space of matrices
- The construction of orbit codes based on singular linear space over finite fields
- Orbit matrices of Hadamard matrices and related codes
- Orbit and coset analysis of the Golay and related codes
- Partitioning of the vector space into orbits by the action of automorphism groups of some codes
- Orbit codes of finite abelian groups and lattices
- On a finite matrix group and orbit codes on Euclidean spheres
- Automorphism groups and isometries for cyclic orbit codes
- Title not available (Why is that?)
This page was built for publication: Orbit codes from forms on vector spaces over a finite field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2070263)
