Related papers: Multi-point Codes over Kummer Extensions
We characterize mixed-level orthogonal arrays in terms of algebraic designs in a special multigraph. We prove a mixed-level analog of the Bierbrauer-Friedman (BF) bound for pure-level orthogonal arrays and show that arrays attaining it are…
We extend coded distributed computing over finite fields to allow the number of workers to be larger than the field size. We give codes that work for fully general matrix multiplication and show that in this case we serendipitously have…
In this paper we compute the order (or Feng-Rao) bound on the minimum distance of one-point algebraic geometry codes, when the Weierstrass semigroup at the point Q is an Arf semigroup. The results developed to that purpose also provide the…
Subspace codes are the $q$-analog of binary block codes in the Hamming metric. Here the codewords are vector spaces over a finite field. They have e.g. applications in random linear network coding, distributed storage, and cryptography. In…
We introduce a multiparametric quantum superspace with $m$ even generators and $n$ odd generators whose commutation relations are in the sense of Manin such that the corresponding algebra has a Hopf superalgebra. By using its Hopf…
We explicitly construct the Kummer variety associated to the Jacobian of a hyperelliptic curve of genus 3 that is defined over a field of characteristic not equal to 2 and has a Weierstra{\ss} point defined over the same field. We also…
We describe a new class of list decodable codes based on Galois extensions of function fields and present a list decoding algorithm. These codes are obtained as a result of folding the set of rational places of a function field using…
Let $A(n,d)$ (respectively $A(n,d,w)$) be the maximum possible number of codewords in a binary code (respectively binary constant-weight $w$ code) of length $n$ and minimum Hamming distance at least $d$. By adding new linear constraints to…
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 investigate additive codes, defined as $\mathbb{F}_q$-linear subspaces $C \subseteq \mathbb{F}_{q^h}^n$ of length $n$ and dimension $r$ over $\mathbb{F}_q$. An additive code is said to be of type $[n, r/h, d]_q^h$, where $d$ denotes the…
Some families of constant dimension codes arising from Riemann-Roch spaces associated to particular divisors of a curve $\X$ are constructed. These families are generalizations of the one constructed by Hansen
We apply Schrijver's semidefinite programming method to obtain improved upper bounds on generalized distances and list decoding radii of binary codes.
We develop Kummer theory for algebraic function fields in finitely many transcendental variables. We consider any finitely generated Kummer extension (possibly, over a cyclotomic extension) of an algebraic function field, and describe the…
Code loops are certain Moufang $2$-loops constructed from doubly even binary codes that play an important role in the construction of local subgroups of sporadic groups. More precisely, code loops are central extensions of the group of…
In the field of algebraic geometric codes (AG codes), the characterization of dual codes has long been a challenging problem which relies on differentials. In this paper, we provide some descriptions for certain differentials utilizing…
This paper provides new constructions and lower bounds for subspace codes, using Ferrers diagram rank-metric codes from matchings of the complete graph and pending blocks. We present different constructions for constant dimension codes with…
Sarvepalli and Klappenecker showed how classical one-point codes on the Hermitian curve can be used to construct quantum codes. Homma and Kim determined the parameters of a larger family of codes, the two-point codes. In quantum…
We achieve new results on skew polynomial rings and their quotients, including the first explicit example of a skew polynomial ring where the ratio of the degree of a skew polynomial to the degree of its bound is not extremal. These methods…
Given a homogeneous component of an exterior algebra, we characterize those subspaces in which every nonzero element is decomposable. In geometric terms, this corresponds to characterizing the projective linear subvarieties of the Grassmann…
Additive one-weight codes over a finite field of non-prime order are equivalent to special subspace coverings of the points of a projective space, which we call multispreads. The current paper is devoted to the characterization of the…