AbstractWe give a brief but complete account of all the essential facts concerning the Reed-Muller and punctured Reed-Muller codes. The treatment is new and includes an easy, direct proof of the fact that the punctured Reed-Muller codes are the codes of the projective geometries over the binary field. We also establish the existence of two short exact sequences that lead to new proofs that the minimum-weight vectors of the Reed-Muller and punctured Reed–Muller codes are the incidence vectors of the appropriate geometric objects
This work aims at presenting results on the length and dimension of codes defined over complete inte...
The famous Barnes-Wall lattices can be obtained by applying Construction D to a chain of Reed-Muller...
AbstractThe a-invariant is determined and a description of the defining ideal for the set SK of rati...
AbstractThis paper shows how to construct analogs of Reed-Muller codes from partially ordered sets. ...
International audienceThe classical generalized Reed-Muller codes introduced by Kasami, Lin and Pete...
The polynomial formulation of generalized ReedMuller codes, first introduced by Kasami, Lin, and Pet...
In this essay we introduce the projective Reed-Muller-type codes over finite fields and explore its ...
Reed-Muller (RM) codes are classical codes that have enjoyed unabated interest since their introduct...
AbstractAn explicit basis of incidence vectors for thep-ary code of the design of points and hyperpl...
AbstractIn this paper we study linear codes that are obtained by annexing some vectors to the basis ...
Reed-Muller (RM) codes are among the oldest, simplest and perhaps most ubiquitous family of codes. T...
Projective Reed-Muller codes correspond to subcodes of the Reed-Muller code in which the polynomials...
We explore the connections between finite geometry and algebraic coding theory, giving a rather full...
AbstractLes codes de Reed–Müller projectifs sur un corps fini sont des extensions des codes de Reed–...
GF(q) denote the finite field with q elements. An [n,k,d] linear code C over GF(q) is a k-dimension...
This work aims at presenting results on the length and dimension of codes defined over complete inte...
The famous Barnes-Wall lattices can be obtained by applying Construction D to a chain of Reed-Muller...
AbstractThe a-invariant is determined and a description of the defining ideal for the set SK of rati...
AbstractThis paper shows how to construct analogs of Reed-Muller codes from partially ordered sets. ...
International audienceThe classical generalized Reed-Muller codes introduced by Kasami, Lin and Pete...
The polynomial formulation of generalized ReedMuller codes, first introduced by Kasami, Lin, and Pet...
In this essay we introduce the projective Reed-Muller-type codes over finite fields and explore its ...
Reed-Muller (RM) codes are classical codes that have enjoyed unabated interest since their introduct...
AbstractAn explicit basis of incidence vectors for thep-ary code of the design of points and hyperpl...
AbstractIn this paper we study linear codes that are obtained by annexing some vectors to the basis ...
Reed-Muller (RM) codes are among the oldest, simplest and perhaps most ubiquitous family of codes. T...
Projective Reed-Muller codes correspond to subcodes of the Reed-Muller code in which the polynomials...
We explore the connections between finite geometry and algebraic coding theory, giving a rather full...
AbstractLes codes de Reed–Müller projectifs sur un corps fini sont des extensions des codes de Reed–...
GF(q) denote the finite field with q elements. An [n,k,d] linear code C over GF(q) is a k-dimension...
This work aims at presenting results on the length and dimension of codes defined over complete inte...
The famous Barnes-Wall lattices can be obtained by applying Construction D to a chain of Reed-Muller...
AbstractThe a-invariant is determined and a description of the defining ideal for the set SK of rati...