Recommendations
Cites work
- scientific article; zbMATH DE number 3137862 (Why is no real title available?)
- scientific article; zbMATH DE number 3843786 (Why is no real title available?)
- scientific article; zbMATH DE number 51371 (Why is no real title available?)
- scientific article; zbMATH DE number 53569 (Why is no real title available?)
- scientific article; zbMATH DE number 65942 (Why is no real title available?)
- scientific article; zbMATH DE number 3467122 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1342088 (Why is no real title available?)
- scientific article; zbMATH DE number 459296 (Why is no real title available?)
- scientific article; zbMATH DE number 736291 (Why is no real title available?)
- scientific article; zbMATH DE number 1009711 (Why is no real title available?)
- scientific article; zbMATH DE number 1024657 (Why is no real title available?)
- scientific article; zbMATH DE number 1101474 (Why is no real title available?)
- scientific article; zbMATH DE number 1116502 (Why is no real title available?)
- scientific article; zbMATH DE number 1117678 (Why is no real title available?)
- scientific article; zbMATH DE number 2079349 (Why is no real title available?)
- scientific article; zbMATH DE number 1795248 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 6414795 (Why is no real title available?)
- 2-designs over \(GF(2^ m)\)
- 2-designs over \(GF(q)\)
- 2-spreads and transitive and orthogonal 2-parallelisms of \(PG(5, 2)\)
- A Bound for Error-Correcting Codes
- A General Class of Maximal Codes ror Computer Applications
- A Random Linear Network Coding Approach to Multicast
- A Rank-Metric Approach to Error Control in Random Network Coding
- A \(t\pmod p\) result on weighted multiple \((n-k)\)-blocking sets in \(\mathrm{PG}(n,q)\)
- A characteristic property of geometric \(t\)-spreads in finite projective spaces
- A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
- A complete characterization of irreducible cyclic orbit codes and their Plücker embedding
- A new family of 2-designs over GF\((q)\) admitting SL\(_m(q^l)\)
- A study of intersections of quadrics having applications on the small weight codewords of the functional codes \(C_2(Q)\), \(Q\) a non-singular quadric
- Algebraically punctured cyclic codes
- An algebraic approach for decoding spread codes
- Association schemes and t-designs in regular semilattices
- Bilinear forms over a finite field, with applications to coding theory
- Blocking \(s\)-dimensional subspaces by lines in \(PG(2s,q)\)
- Blocking sets in Desarguesian affine and projective planes
- Blocking sets in projective spaces
- Blocking sets in projective spaces and polar spaces
- Blocking subspaces by lines in \(PG(n,q)\)
- Bose-Burton type theorems for finite Grassmannians
- Bounds for equidistant codes and partial projective planes
- Bounds for projective codes from semidefinite programming
- Bounds on the number of rational points of algebraic hypersurfaces over finite fields, with applications to projective Reed-Muller codes
- Characterization results on weighted minihypers and on linear codes meeting the Griesmer bound
- Codes and Designs Related to Lifted MRD Codes
- Codes and anticodes in the Grassman graph
- Coding for Errors and Erasures in Random Network Coding
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
- Constructions and families of covering codes and saturated sets of points in projective geometry
- Covering of subspaces by subspaces
- Cyclic Orbit Codes
- Cyclic orbit codes and stabilizer subfields
- Derived and residual subspace designs
- Designs and partial geometries over finite fields
- Designs over finite fields
- Equidistant codes in the Grassmannian
- Error-Correcting Codes in Projective Space
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Every large set of equidistant (0,+1,-1)-vectors forms a sunflower
- Existence of \(q\)-analogs of Steiner systems
- Fractional Repetition Codes With Flexible Repair From Combinatorial Designs
- Functional codes arising from quadric intersections with Hermitian varieties
- Galois geometries and coding theory
- Improved explicit estimates on the number of solutions of equations over a finite field
- Intersection numbers for subspace designs
- Intersection theorems for systems of finite vector spaces
- Isometry and automorphisms of constant dimension codes
- Johnson type bounds on constant dimension codes
- Large sets of \(t\)-designs over finite fields
- Large sets of subspace designs
- Linear authentication codes: bounds and constructions
- Linear network coding
- Locally symmetric designs
- Maximal Flow Through a Network
- Maximum-rank array codes and their application to crisscross error correction
- Minimal and maximal arrangements of hyperplanes in \(\mathbb P^{n}(\mathbb {F}_{q})\)
- Network Coding for Distributed Storage Systems
- Network information flow
- New lower bounds for asymmetric and unidirectional codes
- Nontrivial \(t\)-designs over finite fields exist for all \(t\)
- Normal spreads
- On Metrics for Error Correction in Network Coding
- On \(q\)-analogs of Steiner systems and covering designs
- On a class of small 2‐designs over gf(q)
- On coverings
- On equidistant constant weight codes
- On multiple blocking sets in Galois planes
- On parallelisms in finite projective spaces
- On perfect codes and related concepts
- On point-cyclic resolutions of the 2-(63, 7, 15) design associated with PG(5, 2)
- On primitive constant dimension codes and a geometrical sunflower bound
- On saturating sets in small projective geometries
- On sets of vectors of a finite vector space in which every subset of basis size is a basis
- On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
- On small blocking sets and their linearity
- On subspace codes
- On t-covers in finite projective spaces
- On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions
- On the Locality of Codeword Symbols
- On the Preparata and Goethals codes
- On the automorphism group of a binary \(q\)-analog of the Fano plane
- On the design of storage orbit codes
- On the functional codes arising from the intersections of algebraic hypersurfaces of small degree with a non-singular quadric
- On the functional codes defined by quadrics and Hermitian varieties
- On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes
- On the inequalities of \(t\)-designs over a finite field
- On two minimax theorems in graph
- Optimal Ferrers Diagram Rank-Metric Codes
- Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
- Ovals In a Finite Projective Plane
- Parallelismen in unendlichen projektiven Räumen endlicher Dimension
- Partial \(k\)-parallelisms in finite projective spaces
- Partial parallelisms in finite projective spaces
- Partial spreads in finite projective spaces and partial designs
- Partial t-spreads and group constructible \((s,r,\mu)\)-nets
- Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
- Perfect byte-correcting codes
- Polynomial Time Algorithms for Multicast Network Code Construction
- Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis “Utilising Public Information in Network Coding”
- Projective Geometry over 1 and the Gaussian Binomial Coefficients
- Projective Reed-Muller codes
- Quotient sets and subset-subspace analogy
- Recursive Code Construction for Random Networks
- Reducibility among combinatorial problems
- Regular packings of \(PG(3,q)\)
- Resolutions of PG(5, 2) with point-cyclic automorphism group
- Small blocking sets in higher dimensions
- Special numbers of rational points on hypersurfaces in the \(n\)-dimensional projective space over a finite field
- Subspace Polynomials and Cyclic Subspace Codes
- Subspace codes from Ferrers diagrams
- Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
- Tactical decompositions of designs over finite fields
- The Asymptotic Behavior of Grassmannian Codes
- The CRC handbook of combinatorial designs
- The Erdős-Ko-Rado theorem for vector spaces
- The geometry of covering codes: small complete caps and saturating sets in Galois spaces
- The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)
- The parameters of projective Reed-Müller codes
- The small weight codewords of the functional codes associated to non-singular Hermitian varieties
- The use of blocking sets in Galois geometries and in related research areas
- Theory of codes with maximum rank distance
- Une propriété extremale des plans projectifs finis dans une classe de codes équidistants
- \(q\)-analogs of packing designs
Cited in
(40)- Further results on covering codes with radius \(R\) and codimension \(tR+1\)
- Domination mappings into the Hamming ball: existence, constructions, and algorithms
- Improved upper bounds for partial spreads
- Hamming weight distributions of multi-twisted codes over finite fields
- New lower bounds for partial k‐parallelisms
- Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring
- Functional repair codes: a view from projective geometry
- Applications of finite geometry in coding theory and cryptography
- Cores and independence numbers of Grassmann graphs
- On the weight distribution of the cosets of MDS codes
- scientific article; zbMATH DE number 1844174 (Why is no real title available?)
- On planes through points off the twisted cubic in \(\mathrm{PG}(3,q)\) and multiple covering codes
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
- Arithmetic, Geometry, and Coding Theory: Homage to Gilles Lachaud
- New bounds for linear codes of covering radii 2 and 3
- New constructions of Sidon spaces
- Subspace packings: constructions and bounds
- Johnson type bounds for mixed dimension subspace codes
- Binary subspace codes in small ambient spaces
- scientific article; zbMATH DE number 1795248 (Why is no real title available?)
- New bounds for covering codes of radius 3 and codimension \(3 t + 1\)
- Automorphisms of Grassmann graphs over a residue class ring
- Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects
- Incidence structures, codes, and Galois geometries
- Packings of partial difference sets
- Geometry of smooth extremal surfaces
- Galois geometries and coding theory
- Hamming weight enumerators of multi-twisted codes with at most two non-zero constituents
- Constructions and bounds for mixed-dimension subspace codes
- Coding theory and Galois geometries
- Types of spreads and duality of the parallelisms of \(\mathrm{PG}(3,5)\) with automorphisms of order 13
- Galois geometries, codes, and new invariant for incidence structures
- Perfect LRCs and \(k\)-optimal LRCs
- Galois extensions, positive involutions and an application to unitary space-time coding
- The maximum size of a partial spread in a finite projective space
- An asymptotic property of quaternary additive codes
- Constructions of cyclic constant dimension codes
- Residual \(q\)-Fano planes and related structures
- New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
- Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\)
This page was built for publication: Galois geometries and coding theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q908053)
