A new proof of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords of generalized Reed-Muller code

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We give a new proof of Delsarte, Goethals and Mac williams theorem on minimal
weight codewords of generalized Reed-Muller codes published in 1970. To prove
this theorem, we consider intersection of support of minimal weight codewords
with affine hyperplanes and we proceed by recursion.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A new proof of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords of generalized Reed-Muller code does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A new proof of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords of generalized Reed-Muller code, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new proof of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords of generalized Reed-Muller code will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-355395

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.