Bilinear forms over a finite field, with applications to coding theory

From MaRDI portal

Publication:1254279

Jump to:navigation, search

DOI10.1016/0097-3165(78)90015-8zbMath0397.94012OpenAlexW2095547380MaRDI QIDQ1254279

Philippe Delsarte

Publication date: 1978

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(78)90015-8

zbMATH Keywords

Automorphism Groups Bilinear Forms Finite-Dimensional Vector Spaces Hamming Distance Enumerator Hamming Schemes Macwilliams Identities over Galois Fields Q-Ary Codes Reed-Solomon Codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other designs, configurations (05B30) Polynomials over finite fields (11T06) Quadratic and bilinear forms, inner products (15A63)

Related Items

The homogeneous weight partition and its character-theoretic dual, Equivalence, group of automorphism and invariants of a family of rank metric codes arising from linearized polynomials, Self-duality of generalized twisted Gabidulin codes, Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases, Binary subspace codes in small ambient spaces, Non-linear maximum rank distance codes, Pairs of quadratic forms over finite fields, An algebra associated with a flag in a subspace lattice over a finite field and the quantum affine algebra, Distance-regular graphs of large diameter that are completely regular clique graphs, Rank-metric codes and their duality theory, Median approximations for genomes modeled as matrices, Boolean degree 1 functions on some classical association schemes, Fast operations on linearized polynomials and their applications in coding theory, A new proof of several inequalities on codes and sets, On classical orthogonal polynomials, Exceptional scattered polynomials, A new family of linear maximum rank distance codes, Algebraic structures of MRD codes, Construction of subspace codes through linkage, Explicit constructions of some non-Gabidulin linear maximum rank distance codes, On self-dual MRD codes, Constructions and bounds for mixed-dimension subspace codes, Hermitian rank distance codes, Automorphism groups of Gabidulin-like codes, W-complement d-spreads, singleton systems, Rank metric codes and zeta functions, Generalized Gabidulin codes over fields of any characteristic, An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms, t-designs in classical association schemes, On the number of inequivalent Gabidulin codes, Duality of codes supported on regular lattices, with an application to enumerative combinatorics, On dually almost MRD codes, On \(q\)-Steiner systems from rank metric codes, Character tables of association schemes based on attenuated spaces, A characterization of the association schemes of bilinear forms, On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes, List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques, On transform-domain error and erasure correction by Gabidulin codes, Maximum scattered linear sets and MRD-codes, Fast decoding of Gabidulin codes, Constant rank-distance sets of Hermitian matrices and partial spreads in Hermitian polar spaces, An enumeration of the equivalence classes of self-dual matrix codes, Weight distribution of rank-metric codes, Generalized weights: an anticode approach, Concatenation of convolutional codes and rank metric codes for multi-shot network coding, A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices, On the genericity of maximum rank distance and Gabidulin codes, Some new non-additive maximum rank distance codes, Adjacency preservers, symmetric matrices, and cores, Galois geometries and coding theory, Symmetric bilinear forms over finite fields of even characteristic, Three addition theorems for some q-Krawtchouk polynomials, A partially ordered set and q-Krawtchouk polynomials, Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6, Vertex transitive graphs from injective linear mappings, Universal secure rank-metric coding schemes with optimal communication overheads, A characterization of linearized polynomials with maximum kernel, Linear subspaces of matrices associated to a Ferrers diagram and with a prescribed lower bound for their rank, Classification of 8-dimensional rank two commutative semifields, Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects, Symmetric bilinear forms over finite fields with applications to coding theory, Low-rank matrix recovery using Gabidulin codes in characteristic zero, About non equivalent completely regular codes with identical intersection array, Row reduction applied to decoding of rank-metric and subspace codes, Algebraic decoding of folded Gabidulin codes, Classes and equivalence of linear sets in \(\mathrm{PG}(1,q^{n})\), Generalized bilinear forms graphs and MRD codes over a residue class ring, A new family of MRD-codes, On defining generalized rank weights, MRD-codes and linear sets, A generalization of the normal rational curve in \(\mathrm {PG}(d,q^n)\) and its associated non-linear MRD codes, Roos bound for skew cyclic codes in Hamming and rank metric, Designs as maximum codes in polynomial metric spaces, Completely regular codes with different parameters giving the same distance-regular coset graphs, Constructions of optimal Ferrers diagram rank metric codes, Codes with the rank metric and matroids, Rank-metric complementary dual codes, Subspaces of matrices with special rank properties, An addition theorem for some q-Hahn polynomials, Generalized twisted Gabidulin codes, Norton algebras of the Hamming graphs via linear characters, The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters, New maximum scattered linear sets of the projective line, On deep holes of Gabidulin codes, On the list decodability of self-orthogonal rank-metric codes, Probabilistic algorithm for finding roots of linearized polynomials, Fissions of classical self-dual association schemes, Galois extensions and subspaces of alternating bilinear forms with special rank properties, Decoding of random network codes, On (partial) unit memory codes based on Gabidulin codes, Hyperplane sections of determinantal varieties over finite fields and linear codes, MRD codes with maximum idealizers, Commutative association schemes, Association schemes based on attenuated spaces, A geometric approach to rank metric codes and a classification of constant weight codes, Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications, Wei-type duality theorems for rank metric codes, Hamming and simplex codes for the sum-rank metric, Construction of self-dual matrix codes, Metric coset schemes revisited, Constant dimension codes from multilevel construction based on matchings of complete hypergraphs, LCP of rank metric codes and its an application, Construction of constant dimension codes via improved inserting construction, Almost affinely disjoint subspaces and covering Grassmannian codes, Optimal Ferrers diagram rank-metric codes from MRD codes, Tensor Codes and Their Invariants, Cones from maximum \(h\)-scattered linear sets and a stability result for cylinders from hyperovals, Evasive subspaces, generalized rank weights and near MRD codes, On the equivalence issue of a class of 2-dimensional linear maximum rank distance codes, Rank-Metric Codes, Semifields, and the Average Critical Problem, Generalized block inserting for constructing new constant dimension codes, Bilateral multilevel construction of constant dimension codes, The interplay of different metrics for the construction of constant dimension codes, Constructions of optimal rank-metric codes from automorphisms of rational function fields, Codes with few weights arising from linear sets, Combining subspace codes, Division algebras and MRD codes from skew polynomials, On a family of linear MRD codes with parameters \([8\times 8,16,7_q\)], Densities of codes of various linearity degrees in translation-invariant metric spaces, Antipodal two-weight rank metric codes, Doubly and triply extended MSRD codes, Weight spectra of Gabidulin rank-metric codes and Betti numbers, Saturating systems and the rank-metric covering radius, Constructions of perfect bases for classes of 3-tensors, Rank-Metric Codes and Their Applications, Codes for Distributed Storage, Codes in the Sum-Rank Metric: Fundamentals and Applications, Construction of LCD-MRD codes of length n > N, On the list decodability of rank-metric codes containing Gabidulin codes, Multiple-rate error-correcting coding scheme, Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries, Rank error-correcting pairs, Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius, New constant dimension subspace codes from block inserting constructions, New constant dimension subspace codes from parallel linkage construction and multilevel construction, Constructions of rank metric codes under actions of the unitary groups, Optimal interleaving schemes for correcting two-dimensional cluster errors, Extending two families of maximum rank distance codes, Further results on LCD generalized Gabidulin codes, 50 years of translation structures, Non-minimum tensor rank Gabidulin codes, Common Complements of Linear Subspaces and the Sparseness of MRD Codes, Bilinear forms graphs over residue class rings, Twisted linearized Reed-Solomon codes: a skew polynomial framework, Linear cutting blocking sets and minimal codes in the rank metric, Linear sets from projection of Desarguesian spreads, MRD-codes arising from the trinomial \(x^q + x^{q^3} + c x^{q^5} \in \mathbb{F}_{q^6} [x\)], On kernels and nuclei of rank metric codes, New criteria for MRD and Gabidulin codes and some rank-metric code constructions, Unnamed Item, On equivalence of maximum additive symmetric rank-distance codes, Automorphism groups and new constructions of maximum additive rank metric codes with restrictions, Covering Radius of Matrix Codes Endowed with the Rank Metric, On absolute points of correlations of \(\mathrm{PG}(2,q^{n})\), A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices, Linear sofic groups and algebras, Nuclei and automorphism groups of generalized twisted Gabidulin codes, Identifiers for MRD-codes, The Minimum Distance of Some Narrow-Sense Primitive BCH Codes, New MRD codes from linear cutting blocking sets, Duals of linearized Reed-Solomon codes, New semifields and new MRD codes from skew polynomial rings, Some matroids related to sum-rank metric codes, Rank-metric codes and \(q\)-polymatroids, Equivalence and characterizations of linear rank-metric codes based on invariants, Rank-metric codes, generalized binomial moments and their zeta functions, Matrix graphs and MRD codes over finite principal ideal rings, Partitions of matrix spaces with an application to \(q\)-rook polynomials, Bounds in the Lee metric and optimal codes, Subspace packings: constructions and bounds, On the security of a Loidreau rank metric code based encryption scheme, Unnamed Item, New constructions of constant dimension codes by improved inserting construction, Improved generalized block inserting construction of constant dimension codes, An analogue of Vosper's theorem for extension fields, Quasi optimal anticodes: structure and invariants, Asymptotic behaviour of codes in rank metric over finite fields, Abelian non-cyclic orbit codes and multishot subspace codes, A polymatroid approach to generalized weights of rank metric codes, The energy of \(q\)-Kneser graphs and attenuated \(q\)-Kneser graphs, The Erdős-Ko-Rado theorem for twisted Grassmann graphs, A new rank metric for convolutional codes, NONBINARY DELSARTE–GOETHALS CODES AND FINITE SEMIFIELDS, Low-rank parity-check codes over Galois rings, Linearized trinomials with maximum kernel, Partially scattered linearized polynomials and rank metric codes, Covering of subspaces by subspaces, Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs, Several classes of optimal Ferrers diagram rank-metric codes, Generalized vector space partitions, A modified Dual-Ouroboros public-key encryption using Gabidulin codes, LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding, A coding scheme that increases the code rate, Invariant Semidefinite Programs, Linear sets and MRD-codes arising from a class of scattered linearized polynomials, On decoding additive generalized twisted Gabidulin codes, Tensor Representation of Rank-Metric Codes, Scattered subspaces and related codes, On \(q\)-covering designs, On maximum additive Hermitian rank-metric codes, Partition-balanced families of codes and asymptotic enumeration in coding theory, Subspaces intersecting in at most a point, Vertex properties of maximum scattered linear sets of \(\mathrm{PG} ( 1 , q^n )\), Two coloring problems on matrix graphs, Rank-metric codes, linear sets, and their duality, On the sparseness of certain linear MRD codes, Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices, Puncturing maximum rank distance codes, An Assmus--Mattson Theorem for Rank Metric Codes, Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem, Rank-Metric Codes Over Arbitrary Galois Extensions and Rank Analogues of Reed--Muller Codes, The absorption distribution and the_q-binomial theorem, A new family of maximum scattered linear sets in PG(1, q^6), Theory of supports for linear codes endowed with the sum-rank metric, An asymptotically optimal construction of almost affinely disjoint subspaces, \(q\)-polymatroids and their relation to rank-metric codes, Binary additive MRD codes with minimum distance \(n-1\) must contain a semifield spread set, Partial ‐Parallelisms in Finite Projective Spaces, Rook Theory of the Finite General Linear Group, Encoding and decoding of several optimal rank metric codes, Parallel sub-code construction for constant-dimension codes, Linear codes associated to determinantal varieties, Enhancing Echelon-Ferrers construction for constant dimension code, Equidistant codes in the Grassmannian, Fourier-reflexive partitions and MacWilliams identities for additive codes, Rank-metric lattices, On the eigenvalues of Grassmann graphs, bilinear forms graphs and Hermitian forms graphs, Subspace codes from Ferrers diagrams

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1254279&oldid=13346121"