Director of Research (if dissertation) or Advisor (if thesis)
Duursma, Iwan M.
Doctoral Committee Chair(s)
Reznick, Bruce
Hajek, Bruce
Committee Member(s)
Duursma, Iwan M.
Schenck, Henry K.
Department of Study
Mathematics
Discipline
Mathematics
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Date of Ingest
2014-09-16T17:23:27Z
Keyword(s)
coding theory
Reed-Muller codes
secret sharing
multiparty computation
combinatorics
multiplicity
Abstract
This is a comprehensive study of multiplicative codes of Reed-Muller type and their applications.
Our codes apply to the elds of cryptography and coding theory, especially to multiparty computa-
tion and secret sharing schemes. We also study the AB method to analyze the minimum distance
of linear codes. The multiplicative codes of Reed-Muller type and the AB method are connected
when we study the distance and dual distance of a code and its square. Generator matrices for our
codes use a combination of blocks, where a block consists of all columns of a given weight. Several
interesting linear codes, which are best known linear codes for a given length and dimension, can
be constructed in this way.
i
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
