scientific article; zbMATH DE number 1284429
From MaRDI portal
Publication:4242023
Recommendations
- scientific article; zbMATH DE number 1472190
- scientific article; zbMATH DE number 3212637
- Codes on finite geometries
- Finite geometries, varieties and codes
- Publication:4863697
- Algebraic geometry codes from polyhedral divisors
- On the classification of geometric codes by polynomial functions
- scientific article; zbMATH DE number 4162811
- Polynomial codes
- Coding theory and Galois geometries
Cited in
(61)- Polarities, quasi-symmetric designs, and Hamada's conjecture
- On Berman's characterization of the Reed-Muller codes
- Self-dual codes which are principal ideals of the group algebra \(\mathbb{F}_ 2[\{\mathbb{F}_{2^ m},+\}]\)
- Extendable Steiner designs from finite geometries
- Group structure on projective spaces and cyclic codes over finite fields
- Codes over \(p\)-adic numbers and finite rings invariant under the full affine group
- Another generalisation of the binary Reed-Muller codes and its applications
- New classes of p-ary bent functions
- Defining sets of extended cyclic codes invariant under the affine group
- Enumeration of certain affine invariant extended cyclic codes
- Lattices invariant under the affine general linear group
- On the classification of geometric codes by polynomial functions
- Ideal representation of Reed-Solomon and Reed-Muller codes
- Basic Reed-Muller codes and their connections with powers of radical of group algebra over a non-prime field
- On perfect and Reed-Muller codes over finite fields
- Linear codes of 2-designs as subcodes of the generalized Reed-Muller codes
- The linear codes of \(t\)-designs held in the Reed-Muller and simplex codes
- On the number of q-ary quasi-perfect codes with covering radius 2
- Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes
- Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)
- Local correctability of expander codes
- The permutation modules for finite (affine) general linear groups.
- Information sets and partial permutation decoding for codes from finite geometries
- Basic Reed-Muller codes as group codes
- The minimum locality of linear codes
- Codes from symmetric polynomials
- New advances in permutation decoding of first-order Reed-Muller codes
- Defining sets of cyclic codes invariant under the affine group
- On certain projective geometry codes (Corresp.)
- scientific article; zbMATH DE number 1472190 (Why is no real title available?)
- scientific article; zbMATH DE number 840681 (Why is no real title available?)
- Locality via partially lifted codes
- On algebraic structure of the Reed-Muller codes
- Improved partial permutation decoding for Reed-Muller codes
- Reed-Muller codes and symplectic geometry
- New generalizations of the Reed-Muller codes--II: Nonprimitive codes
- Some applications of Magma in designs and codes: Oval designs, Hermitian unitals and generalized Reed-Muller codes
- The degree of functions and weights in linear codes.
- New classes of affine-invariant codes sandwiched between Reed-Muller codes
- Steiner systems \(S(2,4, 2^m)\) supported by a family of extended cyclic codes
- Parameters of several families of binary duadic codes and their related codes
- Several families of binary cyclic codes with good parameters
- Two classes of constacyclic codes with variable parameters
- Two remarks on the vectorization problem
- Some algebraic questions about the Reed-Muller code
- Fuzzy linear codes based on nested linear codes
- Coxeter codes: extending the Reed-Muller family
- Binary duadic codes and their related codes with a square-root-like lower bound
- More on the sum-freedom of the multiplicative inverse function
- An infinite family of binary cyclic codes and two infinite families of ternary cyclic codes with good parameters
- Constructions of binary cyclic codes with minimum weights exceeding the square-root lower bound
- A tighter bound on the minimum distances for an infinite family of binary BCH codes and its generalization
- Three families of binary cyclic codes with good lower bounds
- Several infinite families of binary cyclic codes with square-root-like lower bounds
- Derivative descendants of cyclic codes and constacyclic codes
- Self-orthogonal and quantum codes over chain rings
- Designer of codes: a tribute to Jennifer Key
- Reed-Muller codes and permutation decoding
- On irredundant orthogonal arrays
- The exact parameters of a family of BCH codes
- Generalized Reed-Muller codes over \({\mathbb{Z}_q}\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242023)
