Galois geometries and coding theory

DOI10.1007/S10623-015-0156-5zbMATH Open1387.94129OpenAlexW2210977112MaRDI QIDQ908053FDOQ908053

Authors: N. E. Zubov 

Publication date: 2 February 2016

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-015-0156-5

Recommendations

• Galois geometries and coding theory
• Coding theory and Galois geometries
• scientific article; zbMATH DE number 1472190
• Open problems in finite projective spaces
• The geometry of covering codes: small complete caps and saturating sets in Galois spaces

zbMATH Keywords

network codingcoding theoryGalois geometriesdesigns and codes over vector spaces

Mathematics Subject Classification ID

Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40) Steiner systems in finite geometry (51E10)

Cites Work

• Maximal Flow Through a Network
• Reducibility among combinatorial problems
• Intersection theorems for systems of finite vector spaces
• Normal spreads
• The CRC handbook of combinatorial designs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bilinear forms over a finite field, with applications to coding theory
• The geometry of covering codes: small complete caps and saturating sets in Galois spaces
• On the Locality of Codeword Symbols
• On the design of storage orbit codes
• Title not available (Why is that?)
• Network information flow
• Title not available (Why is that?)
• Linear network coding
• Network Coding for Distributed Storage Systems
• Cyclic Orbit Codes
• Algebraically punctured cyclic codes
• A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
• A Bound for Error-Correcting Codes
• On t-covers in finite projective spaces
• Title not available (Why is that?)
• Projective Reed-Muller codes
• Title not available (Why is that?)
• Johnson type bounds on constant dimension codes
• Theory of codes with maximum rank distance
• Designs over finite fields
• Designs and partial geometries over finite fields
• Association schemes and t-designs in regular semilattices
• Blocking sets in Desarguesian affine and projective planes
• Regular packings of \(PG(3,q)\)
• On \(q\)-analogs of Steiner systems and covering designs
• Large sets of \(t\)-designs over finite fields
• Existence of \(q\)-analogs of Steiner systems
• Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
• Galois geometries and coding theory
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear authentication codes: bounds and constructions
• On a class of small 2‐designs over gf(q)
• Title not available (Why is that?)
• Resolutions of PG(5, 2) with point-cyclic automorphism group
• On the automorphism group of a binary \(q\)-analog of the Fano plane
• Error-Correcting Codes in Projective Space
• Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
• Intersection numbers for subspace designs
• Maximum-rank array codes and their application to crisscross error correction
• Ovals In a Finite Projective Plane
• Small blocking sets in higher dimensions
• 2-spreads and transitive and orthogonal 2-parallelisms of \(PG(5, 2)\)
• Characterization results on weighted minihypers and on linear codes meeting the Griesmer bound
• Title not available (Why is that?)
• A General Class of Maximal Codes ror Computer Applications
• On two minimax theorems in graph
• On Metrics for Error Correction in Network Coding
• On perfect codes and related concepts
• 2-designs over \(GF(q)\)
• A new family of 2-designs over GF\((q)\) admitting SL\(_m(q^l)\)
• Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
• On the inequalities of \(t\)-designs over a finite field
• Derived and residual subspace designs
• 2-designs over \(GF(2^ m)\)
• Large sets of subspace designs
• Title not available (Why is that?)
• Special numbers of rational points on hypersurfaces in the \(n\)-dimensional projective space over a finite field
• Partial t-spreads and group constructible \((s,r,\mu)\)-nets
• Partial spreads in finite projective spaces and partial designs
• Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
• Codes and anticodes in the Grassman graph
• A complete characterization of irreducible cyclic orbit codes and their Plücker embedding
• Bounds for projective codes from semidefinite programming
• Isometry and automorphisms of constant dimension codes
• Cyclic orbit codes and stabilizer subfields
• On sets of vectors of a finite vector space in which every subset of basis size is a basis
• Codes and Designs Related to Lifted MRD Codes
• \(q\)-analogs of packing designs
• Bounds on the number of rational points of algebraic hypersurfaces over finite fields, with applications to projective Reed-Muller codes
• An algebraic approach for decoding spread codes
• On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
• Constructions and families of covering codes and saturated sets of points in projective geometry
• Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
• Recursive Code Construction for Random Networks
• On subspace codes
• Une propriété extremale des plans projectifs finis dans une classe de codes équidistants
• The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)
• Minimal and maximal arrangements of hyperplanes in \(\mathbb P^{n}(\mathbb {F}_{q})\)
• The parameters of projective Reed-Müller codes
• Title not available (Why is that?)
• On the functional codes defined by quadrics and Hermitian varieties
• The small weight codewords of the functional codes associated to non-singular Hermitian varieties
• Title not available (Why is that?)
• Functional codes arising from quadric intersections with Hermitian varieties
• On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions
• The Erdős-Ko-Rado theorem for vector spaces
• On parallelisms in finite projective spaces
• On point-cyclic resolutions of the 2-(63, 7, 15) design associated with PG(5, 2)
• On coverings
• Improved explicit estimates on the number of solutions of equations over a finite field
• Projective Geometry over  1 and the Gaussian Binomial Coefficients
• On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes
• On small blocking sets and their linearity
• Blocking sets in projective spaces and polar spaces
• Locally symmetric designs
• Quotient sets and subset-subspace analogy
• Title not available (Why is that?)
• Nontrivial \(t\)-designs over finite fields exist for all \(t\)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the functional codes arising from the intersections of algebraic hypersurfaces of small degree with a non-singular quadric
• On equidistant constant weight codes
• Optimal Ferrers Diagram Rank-Metric Codes
• Subspace codes from Ferrers diagrams
• Parallelismen in unendlichen projektiven Räumen endlicher Dimension
• Tactical decompositions of designs over finite fields
• Polynomial Time Algorithms for Multicast Network Code Construction
• Title not available (Why is that?)
• On the Preparata and Goethals codes
• Perfect byte-correcting codes
• The Asymptotic Behavior of Grassmannian Codes
• Blocking \(s\)-dimensional subspaces by lines in \(PG(2s,q)\)
• Blocking subspaces by lines in \(PG(n,q)\)
• Equidistant codes in the Grassmannian
• Title not available (Why is that?)
• Bose-Burton type theorems for finite Grassmannians
• On multiple blocking sets in Galois planes
• Every large set of equidistant (0,+1,-1)-vectors forms a sunflower
• A \(t\pmod p\) result on weighted multiple \((n-k)\)-blocking sets in \(\mathrm{PG}(n,q)\)
• Bounds for equidistant codes and partial projective planes
• Title not available (Why is that?)
• A characteristic property of geometric \(t\)-spreads in finite projective spaces
• On saturating sets in small projective geometries
• On primitive constant dimension codes and a geometrical sunflower bound
• Covering of subspaces by subspaces
• Partial parallelisms in finite projective spaces
• The use of blocking sets in Galois geometries and in related research areas
• Fractional Repetition Codes With Flexible Repair From Combinatorial Designs
• Subspace Polynomials and Cyclic Subspace Codes
• Blocking sets in projective spaces
• New lower bounds for asymmetric and unidirectional codes
• Partial \(k\)-parallelisms in finite projective spaces
• Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis “Utilising Public Information in Network Coding”

Cited In (40)

• Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring
• Title not available (Why is that?)
• Functional repair codes: a view from projective geometry
• On planes through points off the twisted cubic in \(\mathrm{PG}(3,q)\) and multiple covering codes
• Perfect LRCs and \(k\)-optimal LRCs
• Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
• Incidence structures, codes, and Galois geometries
• Binary subspace codes in small ambient spaces
• Types of spreads and duality of the parallelisms of \(\mathrm{PG}(3,5)\) with automorphisms of order 13
• Further results on covering codes with radius \(R\) and codimension \(tR+1\)
• New bounds for covering codes of radius 3 and codimension \(3 t + 1\)
• Hamming weight enumerators of multi-twisted codes with at most two non-zero constituents
• Constructions of cyclic constant dimension codes
• New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
• Residual \(q\)-Fano planes and related structures
• Domination mappings into the Hamming ball: existence, constructions, and algorithms
• On the weight distribution of the cosets of MDS codes
• The maximum size of a partial spread in a finite projective space
• New constructions of Sidon spaces
• Galois geometries and coding theory
• Applications of finite geometry in coding theory and cryptography
• Improved upper bounds for partial spreads
• New lower bounds for partial k‐parallelisms
• Title not available (Why is that?)
• Constructions and bounds for mixed-dimension subspace codes
• Hamming weight distributions of multi-twisted codes over finite fields
• An asymptotic property of quaternary additive codes
• Geometry of smooth extremal surfaces
• Arithmetic, Geometry, and Coding Theory: Homage to Gilles Lachaud
• New bounds for linear codes of covering radii 2 and 3
• Packings of partial difference sets
• Automorphisms of Grassmann graphs over a residue class ring
• Coding theory and Galois geometries
• Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\)
• Cores and independence numbers of Grassmann graphs
• Subspace packings: constructions and bounds
• Galois extensions, positive involutions and an application to unitary space-time coding
• Johnson type bounds for mixed dimension subspace codes
• Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects
• Galois geometries, codes, and new invariant for incidence structures

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)