Asset Details
Do you wish to reserve the book?
Hamming distances from a function to all codewords of a Generalized Reed-Muller code of order one
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Hamming distances from a function to all codewords of a Generalized Reed-Muller code of order one
Do you wish to request the book?
Hamming distances from a function to all codewords of a Generalized Reed-Muller code of order one
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Paper
Hamming distances from a function to all codewords of a Generalized Reed-Muller code of order one
2015
Overview
For any finite field \\({\\mathbb F}_q\\) with \\(q\\) elements, we study the set \\({\\mathcal F}_{(q,m)}\\) of functions from \\({\\mathbb F}_q^m\\) into \\({\\mathbb F}^q\\). We introduce a transformation that allows us to determine a linear system of \\(q^{m+1}\\) equations and \\(q^{m+1}\\) unknowns, which has for solution the Hamming distances of a function in \\({\\mathcal F}_{(q,m)}\\) to all the affine functions.
Publisher
Cornell University Library, arXiv.org
Subject
