New completely regular q-ary codes based on Kronecker products

Details New completely regular q-ary codes based on Kronecker products New completely regular q-ary codes based on Kronecker products

2008-10-28

arxiv.org/abs/0810.4993v1

Computer Science

Information Theory

Submitted to IT-IEEE. Theorem 1 in Section III was presented at the 2nd International Castle Meeting on Coding Theory and Appl

Scientific paper

For any integer $\rho \geq 1$ and for any prime power q, the explicit construction of a infinite family of completely regular (and completely transitive) q-ary codes with d=3 and with covering radius $\rho$ is given. The intersection array is also computed. Under the same conditions, the explicit construction of an infinite family of q-ary uniformly packed codes (in the wide sense) with covering radius $\rho$, which are not completely regular, is also given. In both constructions the Kronecker product is the basic tool that has been used.

Affiliated with

Also associated with

No associations

Rating

New completely regular q-ary codes based on Kronecker products 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 New completely regular q-ary codes based on Kronecker products, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New completely regular q-ary codes based on Kronecker products will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-485281