SearcharxivSearch

arXiv subjects

J. Borges

Publications and source records attributed to J. Borges.

17 recordsLinked to original sources

On completely regular self-dual codes with covering radius $\rho \leq 3$

We give a complete classification of self-dual completely regular codes with covering radius $\rho \leq 3$. For $\rho=1$ the results are almost trivial. For $\rho=2$, by using properties of the more general class of uniformly packed codes in the wide sense, we show that there are two sporadic such codes, of length $8$, and an infinite family, of length $4$, apart from the direct sum of two self-dual completely regular codes with $\rho=1$, each one. For $\rho=3$, in some cases, we use similar techniques to the ones used for $\rho=2$. However, for some other cases we use different methods, namely, the Pless power moments which allow to us to discard several possibilities. We show that there are only two self-dual completely regular codes with $\rho=3$ and $d\geq 3$, which are both ternary: the extended ternary Golay code and the direct sum of three ternary Hamming codes of length 4. Therefore, any self-dual completely regular code with $d\geq 3$ and $\rho=3$ is ternary and has length 12. We provide the intersection arrays for all such codes.

cs.IT

On completely regular and completely transitive codes derived from Hamming codes

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.

math.CO

Z2Z4-Additive Cyclic Codes: Kernel and Rank

A Z2Z4-additive code C subset of Z_2^alpha x Z_4^beta is called cyclic if the set of coordinates can be partitioned into two subsets, the set of Z_2 and the set of Z_4 coordinates, such that any cyclic shift of the coordinates of both subsets leaves the code invariant. Let Phi(C) be the binary Gray image of C. We study the rank and the dimension of the kernel of a Z2Z4-additive cyclic code C, that is, the dimensions of the binary linear codes and ker(Phi(C)). We give upper and lower bounds for these parameters. It is known that the codes and ker(Phi(C)) are binary images of Z2Z4-additive codes R(C) and K(C), respectively. Moreover, we show that R(C) and K(C) are also cyclic and we determine the generator polynomials of these codes in terms of the generator polynomials of the code C.

cs.IT

Binary Images of Z2Z4-Additive Cyclic Codes

A Z2Z4-additive code C is called cyclic if the set of coordinates can be partitioned into two subsets, the set of Z_2 and the set of Z_4 coordinates, such that any cyclic shift of the coordinates of both subsets leaves the code invariant. We study the binary images of Z2Z4-additive cyclic codes. We determine all Z2Z4-additive cyclic codes with odd beta whose Gray images are linear binary codes.

cs.IT

On Completely Regular Codes

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.

math.CO

Completely regular codes by concatenating Hamming codes

We construct new families of completely regular codes by concatenation methods. By combining parity check matrices of cyclic Hamming codes, we obtain families of completely regular codes. In all cases, we compute the intersection array of these codes. We also study when the extension of these codes gives completely regular codes. Some of these new codes are completely transitive.

math.CO

Families of nested completely regular codes and distance-regular graphs

In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius $ρ$ equal to $3$ or $4$, and are $1/2^i$-th parts, for $i\in\{1,\ldots,u\}$ of binary (respectively, extended binary) Hamming codes of length $n=2^m-1$ (respectively, $2^m$), where $m=2u$. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs of diameter $D$ equal to $3$ or $4$ are constructed. In some cases, the constructed codes are also completely transitive codes and the corresponding coset graphs are distance-transitive.

math.CO

New families of completely transitive codes and distance transitive graphs

In this paper new infinite families of linear binary completely transitive codes are presented. They have covering radius $ρ= 3$ and 4, and are a half part of the binary Hamming and the binary extended Hamming code of length $n=2^m-1$ and $2^m$, respectively, where $m$ is even. From these new completely transitive codes, in the usual way, i.e., as coset graphs, new presentations of infinite families of distance transitive coset graphs of diameter three and four, respectively, are constructed.

math.CO

On the number of nonequivalent propelinear extended perfect codes

The paper proves that there exist an exponential number of nonequivalent propelinear extended perfect binary codes of length growing to infinity. Specifically, it is proved that all transitive extended perfect binary codes found by Potapov are propelinear. All such codes have small rank, which is one more than the rank of the extended Hamming code of the same length. We investigate the properties of these codes and show that any of them has a normalized propelinear representation.

math.CO

Self-Dual Codes over Z_2xZ_4

Self-dual codes over $\Z_2\times\Z_4$ are subgroups of $\Z_2^α\times\Z_4^β$ that are equal to their orthogonal under an inner-product that relates to the binary Hamming scheme. Three types of self-dual codes are defined. For each type, the possible values $α,β$ such that there exist a code $\C\subseteq \Z_2^α\times\Z_4^β$ are established. Moreover, the construction of a $\add$-linear code for each type and possible pair $(α,β)$ is given. Finally, the standard techniques of invariant theory are applied to describe the weight enumerators for each type.

cs.IT

Propelinear structure of Z_{2k}-linear codes

Let C be an additive subgroup of $\Z_{2k}^n$ for any $k\geq 1$. We define a Gray map $Φ:\Z_{2k}^n \longrightarrow \Z_2^{kn}$ such that $Φ(\codi)$ is a binary propelinear code and, hence, a Hamming-compatible group code. Moreover, $Φ$ is the unique Gray map such that $Φ(C)$ is Hamming-compatible group code. Using this Gray map we discuss about the nonexistence of 1-perfect binary mixed group code.

cs.IT

The RICH detector of the AMS-02 experiment: status and physics prospects

The Alpha Magnetic Spectrometer (AMS), whose final version AMS-02 is to be installed on the International Space Station (ISS) for at least 3 years, is a detector designed to measure charged cosmic ray spectra with energies up to the TeV region and with high energy photon detection capability up to a few hundred GeV. It is equipped with several subsystems, one of which is a proximity focusing RICH detector with a dual radiator (aerogel+NaF) that provides reliable measurements for particle velocity and charge. The assembly and testing of the AMS RICH is currently being finished and the full AMS detector is expected to be ready by the end of 2008. The RICH detector of AMS-02 is presented. Physics prospects are briefly discussed.

astro-ph

Z2Z4-linear codes: generator matrices and duality

A code ${\cal C}$ is $\Z_2\Z_4$-additive if the set of coordinates can be partitioned into two subsets $X$ and $Y$ such that the punctured code of ${\cal C}$ by deleting the coordinates outside $X$ (respectively, $Y$) is a binary linear code (respectively, a quaternary linear code). In this paper $\Z_2\Z_4$-additive codes are studied. Their corresponding binary images, via the Gray map, are $\Z_2\Z_4$-linear codes, which seem to be a very distinguished class of binary group codes. As for binary and quaternary linear codes, for these codes the fundamental parameters are found and standard forms for generator and parity check matrices are given. For this, the appropriate inner product is deduced and the concept of duality for $\Z_2\Z_4$-additive codes is defined. Moreover, the parameters of the dual codes are computed. Finally, some conditions for self-duality of $\Z_2\Z_4$-additive codes are given.

cs.IT

The AMS-RICH velocity and charge reconstruction

The AMS detector, to be installed on the International Space Station, includes a Ring Imaging Cerenkov detector with two different radiators, silica aerogel (n=1.05) and sodium fluoride (n=1.334). This detector is designed to provide very precise measurements of velocity and electric charge in a wide range of cosmic nuclei energies and atomic numbers. The detector geometry, in particular the presence of a reflector for acceptance purposes, leads to complex Cerenkov patterns detected in a pixelized photomultiplier matrix. The results of different reconstruction methods applied to test beam data as well as to simulated samples are presented. To ensure nominal performances throughout the flight, several detector parameters have to be carefully monitored. The algorithms developed to fulfill these requirements are presented. The velocity and charge measurements provided by the RICH detector endow the AMS spectrometer with precise particle identification capabilities in a wide energy range. The expected performances on light isotope separation are discussed.

astro-ph

The AMS-02 RICH Imager Prototype - In-Beam Tests with 20 GeV/c per Nucleon Ions -

A prototype of the AMS Cherenkov imager (RICH) has been tested at CERN by means of a low intensity 20 GeV/c per nucleon ion beam obtained by fragmentation of a primary beam of Pb ions. Data have been collected with a single beam setting, over the range of nuclear charges 2<Z<~45 in various beam conditions and using different radiators. The charge Z and velocity beta resolutions have been measured.

astro-ph

Cerenkov angle and charge reconstruction with the RICH detector of the AMS experiment

The Alpha Magnetic Spectrometer (AMS) experiment to be installed on the International Space Station (ISS) will be equipped with a proximity focusing Ring Imaging Cerenkov (RICH) detector, for measurements of particle electric charge and velocity. In this note, two possible methods for reconstructing the Cerenkov angle and the electric charge with the RICH, are discussed. A Likelihood method for the Cerenkov angle reconstruction was applied leading to a velocity determination for protons with a resolution of around 0.1%. The existence of a large fraction of background photons which can vary from event to event, implied a charge reconstruction method based on an overall efficiency estimation on an event-by-event basis.

hep-ex