Weighted Reed-Muller codes revisited
From MaRDI portal
Publication:1934223
DOI10.1007/s10623-012-9680-8zbMath1380.94147arXiv1108.6185MaRDI QIDQ1934223
Publication date: 28 January 2013
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.6185
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94B27: Geometric methods (including applications of algebraic geometry) applied to coding theory
12E20: Finite fields (field-theoretic aspects)
94B35: Decoding
Related Items
On Zeros of a Polynomial in a Finite Grid, Minimum distance functions of complete intersections, Rank-Metric Codes Over Arbitrary Galois Extensions and Rank Analogues of Reed--Muller Codes, Three Combinatorial Perspectives on Minimal Codes, On multivariate polynomials with many roots over a finite grid, Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives, Regularity index of the generalized minimum distance function, Direct products in projective Segre codes, Minimum distance functions of graded ideals and Reed-Muller-type codes, More results on the number of zeros of multiplicity at least \(r\), On the next-to-minimal weight of affine Cartesian codes, Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes, Complete intersection vanishing ideals on sets of clutter type over finite fields, Generalized Hamming weights of affine Cartesian codes, Completing the determination of the next-to-minimal weights of affine cartesian codes, Generalized minimum distance functions, Codes over a weighted torus, Relative generalized Hamming weights of affine Cartesian codes, Projective nested Cartesian codes, On the distance of stabilizer quantum codes from \(J\)-affine variety codes, Affine Cartesian codes with complementary duals, On the second Hamming weight of some Reed-Muller type codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- More results on the number of zeros of multiplicity at least \(r\)
- Efficient list decoding of a class of algebraic-geometry codes
- On the structure of generalized toric codes
- A probabilistic remark on algebraic program testing
- Toric varieties, Hirzebruch surfaces and error-correcting codes
- Toric codes over finite fields
- On the parameters of \(r\)-dimensional toric codes
- Evaluation codes from order domain theory
- List Decoding of<tex>$q$</tex>-ary Reed–Muller Codes
- A Note on the Generalisation of the Guruswami–Sudan List Decoding Algorithm to Reed–Muller Codes
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Weighted Reed-Muller codes and algebraic-geometric codes
- A simple approach for construction of algebraic-geometric codes from affine plane curves
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Improved geometric Goppa codes. I. Basic theory
- Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
- Generalized Sudan’s List Decoding for Order Domain Codes
- Toric Surface Codes and Minkowski Sums
- New generalizations of the Reed-Muller codes--I: Primitive codes
- Polynomial weights and code constructions
