We introduce irregular product codes, a class of codes where each codeword is represented by a matrix and the entries in each row (column) of the matrix come from a component row (column) code. As opposed to standard product codes, we do not require that a ...
State machine replication reduces distributed to centralized computing. Any sequential service, modeled by a state machine, can be replicated over any number of processes and made highly available to all of them. At the heart of this fundamental reduction ...
The Mobius inversion formula of the free monogenic inverse semigroup is represented by the Mobius function for Cauchy product. In this short note we describe a Dirichlet analogue of this inverse semigroup. ...
Let K be a field with char(K) ≠ 2. The Witt-Grothendieck ring (K) and the Witt ring W (K) of K are both quotients of the group ring ℤ[𝓖(K)], where 𝓖(K) := K*/(K*)2 is the square class group of K. Since ℤ[𝓖(K)] is integra ...
We study annihilating polynomials and annihilating ideals for elements of Witt rings for groups of exponent 2. With the help of these results and certain calculations involving the Clifford invariant, we are able to give full sets of generators for the ann ...
This work concerns the study of Euclidean minima of maximal orders in central simple algebras. In the first part, we define the concept of ideal lattice in the non-commutative case. Let A be a semi-simple algebra over Q. An ideal lattice over A is a triple ...
This work is dedicated to developing algebraic methods for channel coding. Its goal is to show that in different contexts, namely single-antenna Rayleigh fading channels, coherent and non-coherent MIMO channels, algebraic techniques can provide useful tool ...
This thesis deals with the study of ideal lattices over number fields. Let K be a number field, which is assumed to be CM or totally real. An ideal lattice over K is a pair (I,b), where I is a fractional ideal of K and b : I × I → R is a symmetric positive ...
e analyze a special class of configurations with h sources and N receivers to demonstrate the throughput benefits of network coding and deterministic code design. We show that the throughput benefits network coding offers can increase proportionally to \sq ...
