q-Analogs of Packing Designs

DOI10.1002/JCD.21376zbMath1301.05060arXiv1212.4614OpenAlexW1698238101MaRDI QIDQ3191439

Michael Braun, Jan Reichelt

Publication date: 2 October 2014

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

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

zbMATH Keywords

\(q\)-analogspacking designsconstant dimension codes

Mathematics Subject Classification ID

(q)-calculus and related topics (05A30) Other designs, configurations (05B30) Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40)

Related Items (6)

Binary subspace codes in small ambient spaces ⋮ Construction of subspace codes through linkage ⋮ Constructions and bounds for mixed-dimension subspace codes ⋮ Galois geometries and coding theory ⋮ New and updated semidefinite programming bounds for subspace codes ⋮ New Lower Bounds for Binary Constant-Dimension Subspace Codes

Cites Work

• Unnamed Item
• Unnamed Item
• Designs over finite fields
• 2-designs over \(GF(q)\)
• t-designs on hypergraphs
• Applied finite group actions.
• Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
• Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
• Construction of \((n, r)\)-arcs in \(PG(2, q)\)
• 2-designs over \(GF(2^ m)\)
• Codes and Designs Related to Lifted MRD Codes
• Construction of Linear Codes With Large Minimum Distance
• Optimal Linear Codes From Matrix Groups
• Coding for Errors and Erasures in Random Network Coding
• Maximal Subgroups of Symplectic Groups Stabilizing Spreads II
• On a class of small 2‐designs over gf(q)
• Error-Correcting Codes in Projective Space
• Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance

This page was built for publication: q-Analogs of Packing Designs