28 research outputs found
On the isometries between Z(pk) and Zpk
We prove that, except for the well-known case p=k=2, it is not possible to construct a weight function on Z(pk) for which Z(pk) is isometric to Zpk with the Hamming metri
The codes and the lattices of Hadamard matrices
It has been observed by Assmus and Key as a result of the complete
classification of Hadamard matrices of order 24, that the extremality of the
binary code of a Hadamard matrix H of order 24 is equivalent to the extremality
of the ternary code of H^T. In this note, we present two proofs of this fact,
neither of which depends on the classification. One is a consequence of a more
general result on the minimum weight of the dual of the code of a Hadamard
matrix. The other relates the lattices obtained from the binary code and from
the ternary code. Both proofs are presented in greater generality to include
higher orders. In particular, the latter method is also used to show the
equivalence of (i) the extremality of the ternary code, (ii) the extremality of
the Z_4-code, and (iii) the extremality of a lattice obtained from a Hadamard
matrix of order 48.Comment: 16 pages. minor revisio
Recent progress on weight distributions of cyclic codes over finite fields
Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. In coding theory it is often desirable to know the weight distribution of a cyclic code to estimate the error correcting capability and error probability. In this paper, we present the recent progress on the weight distributions of cyclic codes over finite fields, which had been determined by exponential sums. The cyclic codes with few weights which are very useful are discussed and their existence conditions are listed. Furthermore, we discuss the more general case of constacyclic codes and give some equivalences to characterize their weight distributions
The Evolution of the MacWilliams Extension Theorem to Codes over Finite Modules
In the 1960's Florence MacWilliams proved two important results in coding theory. The first result is that all linear codes over finite fields satisfy the MacWilliams identities. The second result is the MacWilliams Extension Theorem. This theorem proved the equivalence of two notions of code equivalence over finite fields with respect to Hamming weight. This paper studies the evolution of the extension theorem from the classical case of linear codes defined over finite fields, to the case of linear codes defined over finite rings and finally to linear codes defined over finite modules.Keywords: Codes over modules, MacWilliams, extension theorem, Frobenius
Equivalence of Classical and Quantum Codes
In classical and quantum information theory there are different types of error-correcting codes being used. We study the equivalence of codes via a classification of their isometries. The isometries of various codes over Frobenius alphabets endowed with various weights typically have a rich and predictable structure. On the other hand, when the alphabet is not Frobenius the isometry group behaves unpredictably. We use character theory to develop a duality theory of partitions over Frobenius bimodules, which is then used to study the equivalence of codes. We also consider instances of codes over non-Frobenius alphabets and establish their isometry groups. Secondly, we focus on quantum stabilizer codes over local Frobenius rings. We estimate their minimum distance and conjecture that they do not underperform quantum stabilizer codes over fields. We introduce symplectic isometries. Isometry groups of binary quantum stabilizer codes are established and then applied to the LU-LC conjecture
Equivalence Theorems and the Local-Global Property
In this thesis we revisit some classical results about the MacWilliams equivalence theorems for codes over fields and rings. These theorems deal with the question whether, for a given weight function, weight-preserving isomorphisms between codes can be described explicitly. We will show that a condition, which was already known to be sufficient for the MacWilliams equivalence theorem, is also necessary. Furthermore we will study a local-global property that naturally generalizes the MacWilliams equivalence theorems. Making use of F-partitions, we will prove that for various subgroups of the group of invertible matrices the local-global extension principle is valid
Construction of a Large Class of Deterministic Sensing Matrices that Satisfy a Statistical Isometry Property
Compressed Sensing aims to capture attributes of -sparse signals using
very few measurements. In the standard Compressed Sensing paradigm, the
\m\times \n measurement matrix \A is required to act as a near isometry on
the set of all -sparse signals (Restricted Isometry Property or RIP).
Although it is known that certain probabilistic processes generate \m \times
\n matrices that satisfy RIP with high probability, there is no practical
algorithm for verifying whether a given sensing matrix \A has this property,
crucial for the feasibility of the standard recovery algorithms. In contrast
this paper provides simple criteria that guarantee that a deterministic sensing
matrix satisfying these criteria acts as a near isometry on an overwhelming
majority of -sparse signals; in particular, most such signals have a unique
representation in the measurement domain. Probability still plays a critical
role, but it enters the signal model rather than the construction of the
sensing matrix. We require the columns of the sensing matrix to form a group
under pointwise multiplication. The construction allows recovery methods for
which the expected performance is sub-linear in \n, and only quadratic in
\m; the focus on expected performance is more typical of mainstream signal
processing than the worst-case analysis that prevails in standard Compressed
Sensing. Our framework encompasses many families of deterministic sensing
matrices, including those formed from discrete chirps, Delsarte-Goethals codes,
and extended BCH codes.Comment: 16 Pages, 2 figures, to appear in IEEE Journal of Selected Topics in
Signal Processing, the special issue on Compressed Sensin