Related papers: Codes over Hurwitz integers
Linear codes are considered over the ring Z_4+uZ_4, a non-chain extension of Z_4. Lee weights, Gray maps for these codes are defined and MacWilliams identities for the complete, symmetrized and Lee weight enumerators are proved. Two…
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…
We introduce the new concept of computation coding. Similar to how rate-distortion theory is concerned with the lossy compression of data, computation coding deals with the lossy computation of functions. Particularizing to linear…
Duadic group algebra codes are a generalization of quadratic residue codes. This paper settles an open problem raised by Zhu concerning the existence of duadic group algebra codes. These codes can be used to construct degenerate quantum…
The asymptotic study of class numbers of binary quadratic forms is a foundational problem in arithmetic statistics. Here, we investigate finer statistics of class numbers by studying their self-correlations under additive shifts.…
Orthogonal designs are fundamental mathematical notions used in the construction of space time block codes for wireless transmissions. Designs have two important parameters, the rate and the decoding delay; the main problem of the theory is…
Quantum convolutional codes can be used to protect a sequence of qubits of arbitrary length against decoherence. We introduce two new families of quantum convolutional codes. Our construction is based on an algebraic method which allows to…
We present an algorithm for manipulating quantum information via a sequence of projective measurements. We frame this manipulation in the language of stabilizer codes: a quantum computation approach in which errors are prevented and…
The insertion-deletion codes were motivated to correct the synchronization errors. In this paper we prove several coordinate-ordering-free upper bounds on the insdel distances of linear codes, which are based on the generalized Hamming…
Tensor codes are a generalisation of matrix codes. Such codes are defined as subspaces of order-r tensors for which the ambient space is endowed with the tensor-rank as a metric. A class of these codes was introduced by Roth, who also…
In this paper, we prove Hurwitz-Eichler type formulas for Hurwitz class numbers with each level $ M $ when the modular curve $ X_0(M) $ has genus zero. A key idea is to calculate intersection numbers of modular correspondences with the…
We consider the joint design of polar coding and higher-order modulation schemes for ever increased spectral efficiency. The close connection between the polar code construction and the multi-level coding approach is described in detail.…
A quantum code is a subspace of a Hilbert space of a physical system chosen to be correctable against a given class of errors, where information can be encoded. Ideally, the quantum code lies within the ground space of the physical system.…
Maximum Hermitian rank metric codes were introduced by Schmidt in 2018 and in this paper we propose both interpolation-based encoding and decoding algorithms for this family of codes when the length and the minimum distance of the code are…
The canonical covering maps from Hurwitz varieties to configuration varieties are important in algebraic geometry. The scheme-theoretic fiber above a rational point is commonly connected, in which case it is the spectrum of a Hurwitz number…
The use of skew polynomial rings allows to endow linear codes with cyclic structures which are not cyclic in the classical (commutative) sense. Whenever these skew cyclic structures are carefully chosen, some control over the Hamming…
Decoding of convolutional codes poses a significant challenge for coding theory. Classical methods, based on e.g. Viterbi decoding, suffer from being computationally expensive and are restricted therefore to codes of small complexity. Based…
Approaching Shannon's capacity via geometric shaping has usually been regarded as challenging due to modulation and demodulation complexity, requiring look-up tables to store the constellation points and constellation bit labeling. To…
Permutation codes are a class of structured vector quantizers with a computationally-simple encoding procedure based on sorting the scalar components. Using a codebook comprising several permutation codes as subcodes preserves the…
Classes of self-dual codes and dual-containing codes are constructed. The codes are obtained within group rings and, using an isomorphism between group rings and matrices, equivalent codes are obtained in matrix form. Distances and other…