Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userNew completely regular q-ary codes based on Kronecker products
162
0
0.0
(
0
)
Added by
Josep Rif\\`a
Publication date
2008
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
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.
rate research
Read More
This work is a survey on completely regular codes. Known properties, relations with other combinatorial structures and constructions are stated. The existence problem is also discussed and known results for some particular cases are established. In particular, we present a few new results on completely regular codes with covering radius 2 and on extended completely regular codes.
The $q$-ary block codes with two distances $d$ and $d+1$ are considered. Several constructions of such codes are given, as in the linear case all codes can be obtained by a simple modification of linear equidistant codes. Upper bounds for the maximum cardinality of such codes is derived. Tables of lower and upper bounds for small $q$ and $n$ are presented.
Given a parity-check matrix $H_m$ of a $q$-ary Hamming code, we consider a partition of the columns into two subsets. Then, we consider the two codes that have these submatrices as parity-check matrices. We say that anyone of these two codes is the supplementary code of the other one. We obtain that if one of these codes is a Hamming code, then the supplementary code is completely regular and completely transitive. If one of the codes is completely regular with covering radius $2$, then the supplementary code is also completely regular with covering radius at most $2$. Moreover, in this case, either both codes are completely transitive, or both are not. With this technique, we obtain infinite families of completely regular and completely transitive codes which are quasi-perfect uniformly packed.
The Doob scheme $D(m,n+n)$ is a metric association scheme defined on $E_4^m times F_4^{n}times Z_4^{n}$, where $E_4=GR(4^2)$ or, alternatively, on $Z_4^{2m} times Z_2^{2n} times Z_4^{n}$. We prove the MacWilliams identities connecting the weight distributions of a linear or additive code and its dual. In particular, for each case, we determine the dual scheme, on the same set but with different metric, such that the weight distribution of an additive code $C$ in the Doob scheme $D(m,n+n)$ is related by the MacWilliams identities with the weight distribution of the dual code $C^perp$ in the dual scheme. We note that in the case of a linear code $C$ in $E_4^m times F_4^{n}$, the weight distributions of $C$ and $C^perp$ in the same scheme are also connected.
Let $q=2^n$, $0leq kleq n-1$, $n/gcd(n,k)$ be odd and $k eq n/3, 2n/3$. In this paper the value distribution of following exponential sums [sumlimits_{xin bF_q}(-1)^{mathrm{Tr}_1^n(alpha x^{2^{2k}+1}+beta x^{2^k+1}+ga x)}quad(alpha,beta,gain bF_{q})] is determined. As an application, the weight distribution of the binary cyclic code $cC$, with parity-check polynomial $h_1(x)h_2(x)h_3(x)$ where $h_1(x)$, $h_2(x)$ and $h_3(x)$ are the minimal polynomials of $pi^{-1}$, $pi^{-(2^k+1)}$ and $pi^{-(2^{2k}+1)}$ respectively for a primitive element $pi$ of $bF_q$, is also determined.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
