Projective Parameterized Linear Codes Arising from some Matrices and their Main Parameters

Details Projective Parameterized Linear Codes Arising from some Matrices and their Main Parameters Projective Parameterized Linear Codes Arising from some Matrices and their Main Parameters

2011-08-31

arxiv.org/abs/1108.6114v2

Computer Science

Information Theory

13 pages

Scientific paper

In this paper we will estimate the main parameters of some evaluation codes which are known as projective parameterized codes. We will find the length of these codes and we will give a formula for the dimension in terms of the Hilbert function associated to two ideals, one of them being the vanishing ideal of the projective torus. Also we will find an upper bound for the minimum distance and, in some cases, we will give some lower bounds for the regularity index and the minimum distance. These lower bounds work in several cases, particularly for any projective parameterized code associated to the incidence matrix of uniform clutters and then they work in the case of graphs.

Affiliated with

Also associated with

No associations

Rating

Projective Parameterized Linear Codes Arising from some Matrices and their Main Parameters 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 Projective Parameterized Linear Codes Arising from some Matrices and their Main Parameters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Projective Parameterized Linear Codes Arising from some Matrices and their Main Parameters will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-624799