From Linear Codes to Hyperplane Arrangements via Thomas Decomposition

Details From Linear Codes to Hyperplane Arrangements via Thomas Decomposition From Linear Codes to Hyperplane Arrangements via Thomas Decomposition

2012-02-16

arxiv.org/abs/1202.3625v1

Computer Science

Information Theory

Scientific paper

We establish a connection between linear codes and hyperplane arrangements using the Thomas decomposition of polynomial systems and the resulting counting polynomial. This yields both a generalization and a refinement of the weight enumerator of a linear code. In particular, one can deal with infinitely many finite fields simultaneously by defining a weight enumerator for codes over infinite fields.

Affiliated with

Also associated with

No associations

Rating

From Linear Codes to Hyperplane Arrangements via Thomas Decomposition 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 From Linear Codes to Hyperplane Arrangements via Thomas Decomposition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and From Linear Codes to Hyperplane Arrangements via Thomas Decomposition will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-125807