Groebner bases and combinatorics for binary codes

Details Groebner bases and combinatorics for binary codes Groebner bases and combinatorics for binary codes

2005-09-08

arxiv.org/abs/math/0509164v1

Mathematics

Combinatorics

Submitted to Appl. Algebra Engrg. Comm. Comput

Scientific paper

In this paper we introduce a binomial ideal derived from a binary linear code. We present some applications of a Gr\"obner basis of this ideal with respect to a total degree ordering. In the first application we give a decoding method for the code. By associating the code with the set of cycles in a graph, we can solve the problem of finding all codewords of minimal length (minimal cycles in a graph), and show how to find a minimal cycle basis. Finally we discuss some results on the computation of the Gr\"obner basis.

Affiliated with

Also associated with

No associations

Rating

Groebner bases and combinatorics for binary codes 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 Groebner bases and combinatorics for binary codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Groebner bases and combinatorics for binary codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1790