916,384 research outputs found
Matrix Code
Matrix Code gives imperative programming a mathematical semantics and
heuristic power comparable in quality to functional and logic programming. A
program in Matrix Code is developed incrementally from a specification in
pre/post-condition form. The computations of a code matrix are characterized by
powers of the matrix when it is interpreted as a transformation in a space of
vectors of logical conditions. Correctness of a code matrix is expressed in
terms of a fixpoint of the transformation. The abstract machine for Matrix Code
is the dual-state machine, which we present as a variant of the classical
finite-state machine.Comment: 39 pages, 19 figures; extensions and minor correction
Golay and other box codes
The (24,12;8) extended Golay Code can be generated as a 6 x 4 binary matrix from the (15,11;3) BCH-Hamming Code, represented as a 5 x 3 matrix, by adding a row and a column, both of odd or even parity. The odd-parity case provides the additional 12th dimension. Furthermore, any three columns and five rows of the 6 x 4 Golay form a BCH-Hamming (15,11;3) Code. Similarly a (80,58;8) code can be generated as a 10 x 8 binary matrix from the (63,57;3) BCH-Hamming Code represented as a 9 x 7 matrix by adding a row and a column both of odd and even parity. Furthermore, any seven columns along with the top nine rows is a BCH-Hamming (53,57;3) Code. A (80,40;16) 10 x 8 matrix binary code with weight structure identical to the extended (80,40;16) Quadratic Residue Code is generated from a (63,39;7) binary cyclic code represented as a 9 x 7 matrix, by adding a row and a column, both of odd or even parity
Performance analysis and optimization of the JOREK code for many-core CPUs
This report investigates the performance of the JOREK code on the Intel
Knights Landing and Skylake processor architectures. The OpenMP scaling of the
matrix construction part of the code was analyzed and improved synchronization
methods were implemented. A new switch was implemented to control the number of
threads used for the linear equation solver independently from other parts of
the code. The matrix construction subroutine was vectorized, and the data
locality was also improved. These steps led to a factor of two speedup for the
matrix construction
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
Index Coding: Rank-Invariant Extensions
An index coding (IC) problem consisting of a server and multiple receivers
with different side-information and demand sets can be equivalently represented
using a fitting matrix. A scalar linear index code to a given IC problem is a
matrix representing the transmitted linear combinations of the message symbols.
The length of an index code is then the number of transmissions (or
equivalently, the number of rows in the index code). An IC problem is called an extension of another IC problem if the
fitting matrix of is a submatrix of the fitting matrix of . We first present a straightforward \textit{-order} extension
of an IC problem for which an index code is
obtained by concatenating copies of an index code of . The length
of the codes is the same for both and , and if the
index code for has optimal length then so does the extended code for
. More generally, an extended IC problem of having
the same optimal length as is said to be a \textit{rank-invariant}
extension of . We then focus on -order rank-invariant extensions
of , and present constructions of such extensions based on involutory
permutation matrices
- …