Another generalisation of the binary Reed-Muller codes and its applications
From MaRDI portal
Recommendations
- The minimum distance of new generalisations of the punctured binary Reed-Muller codes
- Linear codes of 2-designs as subcodes of the generalized Reed-Muller codes
- New generalizations of the Reed-Muller codes--I: Primitive codes
- On Reed-Muller codes over F₂+u F₂ and some applications
- Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes
Cites work
- \(LCD\) codes from adjacency matrices of graphs
- An Infinite Family of Steiner Systems from Cyclic Codes
- Codes cycliques étendus affines-invariants et antichaines d'un ensemble partiellement ordonné. (Affine-invariant extended cyclic codes and antichains of a partially ordered set.)
- Complementary Dual Algebraic Geometry Codes
- Complementary dual codes for counter-measures to side-channel attacks
- Enumeration of certain affine invariant extended cyclic codes
- Fundamentals of Error-Correcting Codes
- Generalizations of the BCH bound
- Generalized Reed-Muller codes and curves with many points
- scientific article; zbMATH DE number 53917 (Why is no real title available?)
- scientific article; zbMATH DE number 1284429 (Why is no real title available?)
- scientific article; zbMATH DE number 1284432 (Why is no real title available?)
- scientific article; zbMATH DE number 6900653 (Why is no real title available?)
- LCD Cyclic Codes Over Finite Fields
- Linear codes with complementary duals
- Linear codes with complementary duals meet the Gilbert-Varshamov bound
- Locally decodable codes: a brief survey
- Minimum-weight codewords as generators of generalized Reed-Muller codes
- New generalizations of the Reed-Muller codes--I: Primitive codes
- On cyclic codes that are invariant under the general linear group
- On generalized ReedMuller codes and their relatives
- Reversible codes
- Some results on cyclic codes which are invariant under the affine group and their applications
- The automorphism groups of BCH codes and of some affine-invariant codes over extension fields
- The permutation group of affine-invariant extended cyclic codes
Cited in
(15)- The minimum distance of new generalisations of the punctured binary 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}\)
- A generalization of the binary preparata code
- Some t-designs from BCH codes
- Binary Reed-Muller codes and Hamming spheres
- A Note on the Generalisation of the Guruswami–Sudan List Decoding Algorithm to Reed–Muller Codes
- Binary multilevel coset codes based on Reed-Muller codes
- On generalized ReedMuller codes and their relatives
- New classes of affine-invariant codes sandwiched between Reed-Muller codes
- Infinite families of \(t\)-designs and strongly regular graphs from punctured codes
- Steiner systems \(S(2,4, 2^m)\) supported by a family of extended cyclic codes
- Two classes of constacyclic codes with variable parameters
- Parameterization of Boolean functions by vectorial functions and associated constructions
- Combinatorial t-designs and strongly regular graphs from projective codes over finite fields
- A class of affine-invariant codes and their related codes
This page was built for publication: Another generalisation of the binary Reed-Muller codes and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1654499)
