The Structure of Z2Z2s-Additive Codes: Bounds on the Minimum Distance
نویسندگان
چکیده
Abstract: Z2Z4-additive codes, as a special class of abelian codes, have found a very welcoming place in the recent studies of algebraic coding theory. This family in one hand is similar to binary codes on the other hand is similar to quaternary codes. The structure of Z2Z4additive codes and their duals has been determined lately. In this study we investigate the algebraic structure of Z2Z2s -additive codes which are a natural generalization of Z2Z4-additive codes. We present the standard form of the generator and parity-check matrices of the Z2Z2s -additive codes. Also, we give two bounds on the minimum distance of Z2Z2s -additive codes and compare them.
منابع مشابه
Formally self-dual additive codes over F4 and near-extremal self-dual codes
We introduce a class of formally self-dual additive codes over F4 as a natural analogue of binary formally self-dual codes, which is missing in the study of additive codes over F4. We define extremal formally self-dual additive codes over F4 and classify all such codes. Interestingly, we find exactly three formally self-dual additive (7, 27) odd codes over F4 with minimum distance d = 4, a bett...
متن کاملPerturbation bounds for $g$-inverses with respect to the unitarily invariant norm
Let complex matrices $A$ and $B$ have the same sizes. Using the singular value decomposition, we characterize the $g$-inverse $B^{(1)}$ of $B$ such that the distance between a given $g$-inverse of $A$ and the set of all $g$-inverses of the matrix $B$ reaches minimum under the unitarily invariant norm. With this result, we derive additive and multiplicative perturbation bounds of the nearest per...
متن کاملWoven codes with outer warp: variations, design, and distance properties
In this paper we consider convolutional and block encoding schemes which are variations of woven codes with outer warp. We propose methods to evaluate the distance characteristics of the considered codes on the basis of the active distances of the component codes. With this analytical bounding technique, we derived lower bounds on the minimum (or free) distance of woven convolutional codes, wov...
متن کاملFinding Small Stopping Sets in the Tanner Graphs of LDPC Codes
The performance of low-density parity-check (LDPC) codes over the binary erasure channel for a low erasure probability is limited by small stopping sets. The frame error rate over the additive white Gaussian noise (AWGN) channel for a high signal-to-noise ratio is limited by small trapping sets and by the minimum distance of the LDPC code, which is equal to the codeword with the minimal Hamming...
متن کاملNew bounds on proximity and remoteness in graphs
The average distance of a vertex $v$ of a connected graph $G$is the arithmetic mean of the distances from $v$ to allother vertices of $G$. The proximity $pi(G)$ and the remoteness $rho(G)$of $G$ are defined as the minimum and maximum averagedistance of the vertices of $G$. In this paper we investigate the difference between proximity or remoteness and the classical distanceparameters diameter a...
متن کامل