Subspace code constructions

DOI10.1007/S11587-020-00521-9MaRDI QIDQ2147947zbMATH OpenOpenAlexFDO

Authors Giuseppe Marino, Francesco Pavese, Antonio Cossidente

Publication date 21 June 2022

Published in Ricerche di Matematica (Search for Journal in Brave)

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

zbMATH Keywords

Singer cyclic groupconstant dimension subspace codecircumscribed bundle

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20) Bounds on codes (94B65)

Abstract: We improve on the lower bound of the maximum number of planes of $mPG(8,q)$ mutually intersecting in at most one point leading to the following lower bound: ${calA}_q(9,4;3)ge{q}^{12}+2q^8+2q^7+q^6+q^5+q^4+1$ for constant dimension subspace codes. We also construct two new non-equivalent $(6,(q^3-1)(q^2+q+1),4;3{)}_q$ constant dimension subspace orbit-codes.

Recommendations

• Subspaces intersecting in at most a point
• New constant dimension subspace codes from parallel linkage construction and multilevel construction
• New lower bounds for binary constant-dimension subspace codes
• On subspace codes
• Subspace codes in \(\operatorname{PG}(2N-1; q)\)

Cites work

• scientific article; zbMATH DE number 3917102 (Why is no real title available?)
• scientific article; zbMATH DE number 53569 (Why is no real title available?)
• scientific article; zbMATH DE number 1101474 (Why is no real title available?)
• A Rank-Metric Approach to Error Control in Random Network Coding
• A construction of orbit codes
• Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
• Codes and Designs Related to Lifted MRD Codes
• Coding for Errors and Erasures in Random Network Coding
• Construction of subspace codes through linkage
• Endliche Gruppen I
• Isometry and automorphisms of constant dimension codes
• Johnson type bounds on constant dimension codes
• Mixed partitions of PG(5,q)
• Mixed partitions of projective geometries
• New lower bounds for binary constant-dimension subspace codes
• On subspace codes
• Projective bundles
• Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks
• Subspace codes in \(\operatorname{PG}(2N-1; q)\)
• Subspaces intersecting in at most a point
• The covering radius of \(\mathrm{PGL}(3, q)\)
• Veronese subspace codes

Cited in

(11)

• Subspace subcodes of generalized Reed-Solomon codes
• Recipes for adjoint code construction
• Efficient encoding for a class of subspace subcodes
• Construction of Constant Dimension Subspace Codes by Modifying Linkage Construction
• Subspaces intersecting in at most a point
• Locality and Availability of Array Codes Constructed From Subspaces
• On the sunflower bound for \(k\)-spaces, pairwise intersecting in a point
• Identifying High-Dimension Subspace Subcodes of Reed–Solomon Codes
• Small complete caps in PG(4n+1,q)${\rm PG}(4n+1, q)$
• Subspace Codes
• New constructions of optimal subsystem codes

This page was built for publication: Subspace code constructions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147947)