Generalized Hamming weights of q-ary Reed-Muller codes

From MaRDI portal
Revision as of 02:23, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4392444


DOI10.1109/18.651015zbMath1053.94581MaRDI QIDQ4392444

Pellikaan, Ruud, P. W. Heijnen

Publication date: 3 June 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.651015


94B65: Bounds on codes


Related Items

Varieties over finite fields: quantitative theory, On the Bias of Reed--Muller Codes over Odd Prime Fields, A Combinatorial Approach to the Number of Solutions of Systems of Homogeneous Polynomial Equations over Finite Fields, Weight enumerators of Reed-Muller codes from cubic curves and their duals, Number of solutions of systems of homogeneous polynomial equations over finite fields, Remarks on the Tsfasman-Boguslavsky Conjecture and higher weights of projective Reed-Muller codes, On the existence of order functions, On the Purity of Resolutions of Stanley-Reisner Rings Associated to Reed-Muller Codes, Generalized Hamming weights of toric codes over hypersimplices and squarefree affine evaluation codes, Relative generalized Hamming weights of evaluation codes, Higher Hamming weights for locally recoverable codes on algebraic curves, Further improvements on the Feng-Rao bound for dual codes, Weight enumeration of codes from finite spaces, Generalized Hamming weights of codes over the \(\mathcal{GH}\) curve, Weierstrass semigroup at \(m+1\) rational points in maximal curves which cannot be covered by the Hermitian curve, The second generalized Hamming weight for two-point codes on a Hermitian curve, On the number of solutions of polynomial systems, Generalized Reed-Muller codes and curves with many points, Parameters of the codes over affine varieties, A class of cyclotomic linear codes and their generalized Hamming weights, The second generalized Hamming weight of some evaluation codes arising from a projective torus, The second Feng-Rao number for codes coming from telescopic semigroups, Relative generalized Hamming weights of cyclic codes, Vanishing ideals of projective spaces over finite fields and a projective footprint bound, Generalized Hamming weights of affine Cartesian codes, On the second Feng-Rao distance of algebraic geometry codes related to Arf semigroups, Goppa-like bounds for the generalized Feng-Rao distances., On linear projective codes which satisfy the chain condition., A note on the generalized Hamming weights of Reed-Muller codes, Generalized minimum distance functions, Weight distributions and weight hierarchies of two classes of binary linear codes, The dual of an evaluation code, Counting plane cubic curves over finite fields with a prescribed number of rational intersection points, Weight hierarchies of a family of linear codes associated with degenerate quadratic forms, Weight distributions and weight hierarchies of a family of \(p\)-ary linear codes, Covering symmetric sets of the Boolean cube by affine hyperplanes, GHWs of codes arising from Cartesian product of graphs, Batch codes from affine Cartesian codes and quotient spaces, GHWs of codes derived from the incidence matrices of some graphs, Relative generalized Hamming weights of affine Cartesian codes, Evaluation codes and their basic parameters, Generalized Hamming weights of projective Reed-Muller-type codes over graphs, Linear codes over signed graphs, Hermitian codes and complete intersections, Bounds for generalized Hamming weights of general AG codes, Generalized Hamming weights of three classes of linear codes, Relative generalized Hamming weights of \(q\)-ary Reed-Muller codes, Minimum-weight codewords of the Hermitian codes are supported on complete intersections, Feng-Rao decoding of primary codes, Evaluation codes from order domain theory, Codes from symmetric polynomials, On the generalized Feng-Rao numbers of numerical semigroups generated by intervals, Maximum Number of Common Zeros of Homogeneous Polynomials over Finite Fields