English
Related papers

Related papers: Explicit Constructions of Sum-Rank Metric Codes fr…

200 papers

For the structure functions of the quark propagator, the asymptotic behavior is obtained for general, linear, covariant gauges, and in all directions of the complex $k^2$-plane. Asymptotic freedom is assumed. Corresponding previous results…

High Energy Physics - Theory · Physics 2009-10-30 Reinhard Oehme , Wentao Xu

We give sufficient conditions for self-orthogonality with respect to symplectic, Euclidean and Hermitian inner products of a wide family of quasi-cyclic codes of index two. We provide lower bounds for the symplectic weight and the minimum…

Information Theory · Computer Science 2019-02-15 Carlos Galindo , Fernando Hernando , Ryutaroh Matsumoto

Security of linear ramp secret sharing schemes can be characterized by the relative generalized Hamming weights of the involved codes. In this paper we elaborate on the implication of these parameters and we devise a method to estimate…

Information Theory · Computer Science 2015-02-04 Olav Geil , Stefano Martin , Ryutaroh Matsumoto , Diego Ruano , Yuan Luo

We transpose the theory of rank metric and Gabidulin codes to the case of fields which are not finite fields. The Frobenius automorphism is replaced by any element of the Galois group of a cyclic algebraic extension of a base field. We use…

Symbolic Computation · Computer Science 2014-12-19 Daniel Augot

The $b$-symbol metric is a generalization of the Hamming metric. Linear codes, in the $b$-symbol metric, have been used in the read channel whose outputs consist of $b$ consecutive symbols. The Griesmer bound outperforms the Singleton bound…

Information Theory · Computer Science 2024-01-11 Gaojun Luo , Martianus Frederic Ezerman , Cem Güneri , San Ling , Ferruh Özbudak

In this paper, we investigate completely decomposable rank-metric codes, i.e. rank-metric codes that are the direct sum of 1-dimensional maximum rank distance codes. We study the weight distribution of such codes, characterizing codewords…

Information Theory · Computer Science 2024-06-28 Paolo Santonastaso

We complete the building-up construction for self-dual codes by resolving the open cases over $GF(q)$ with $q \equiv 3 \pmod 4$, and over $\Z_{p^m}$ and Galois rings $\GR(p^m,r)$ with an odd prime $p$ satisfying $p \equiv 3 \pmod 4$ with…

Information Theory · Computer Science 2012-01-30 Yoonjin Lee , Jon-Lark Kim

A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…

Information Theory · Computer Science 2015-12-23 Can Xiang

Sum-rank metric codes have recently attracted the attention of many researchers, due to their relevance in several applications. Mathematically, the sum-rank metric is a natural generalization of both the Hamming metric and the rank metric.…

Galois hulls of linear codes have important applications in quantum coding theory. In this paper, we construct some new classes of (extended) generalized Reed-Solomon (GRS) codes with Galois hulls of arbitrary dimensions. We also propose a…

Information Theory · Computer Science 2021-08-03 Xiaolei Fang , Renjie Jin , Jinquan Luo , Wen Ma

Parametric geometry of numbers is a new theory, recently created by Schmidt and Summerer, which unifies and simplifies many aspects of classical Diophantine approximations, providing a handle on problems which previously seemed out of…

Number Theory · Mathematics 2019-05-07 Damien Roy , Michel Waldschmidt

The projective space of order $n$ over a finite field $\F_q$ is a set of all subspaces of the vector space $\F_q^{n}$. In this work, we consider error-correcting codes in the projective space, focusing mainly on constant dimension codes. We…

Information Theory · Computer Science 2011-09-09 Natalia Silberstein

Bent functions, or equivalently, Hadamard difference sets in the elementary Abelian group $(\gf(2^{2m}), +)$, have been employed to construct symmetric and quasi-symmetric designs having the symmetric difference property. The main objective…

Combinatorics · Mathematics 2019-04-26 Cunsheng Ding , Akihiro Munemasa , Vladimir Tonchev

We present several results on quantum codes over general alphabets (that is, in which the fundamental units may have more than 2 states). In particular, we consider codes derived from finite symplectic geometry assumed to have additional…

Quantum Physics · Physics 2007-05-23 Eric M. Rains

This paper provides new constructive lower bounds for constant dimension codes, using different techniques such as Ferrers diagram rank metric codes and pending blocks. Constructions for two families of parameters of constant dimension…

Information Theory · Computer Science 2014-09-03 Natalia Silberstein , Anna-Lena Trautmann

Four constructions for Ferrers diagram rank-metric (FDRM) codes are presented. The first one makes use of a characterization on generator matrices of a class of systematic maximum rank distance codes. By introducing restricted Gabidulin…

Combinatorics · Mathematics 2019-10-10 Shuangqing Liu , Yanxun Chang , Tao Feng

We give an asymptotic formula for the number of elliptic curves over $\mathbb{Q}$ with bounded Faltings height. Silverman has shown that the Faltings height for elliptic curves over number fields can be expressed in terms of modular…

Number Theory · Mathematics 2016-02-18 Ruthi Hortsch

Generalized metrics, arising from Lawvere's view of metric spaces as enriched categories, have been widely applied in denotational semantics as a way to measure to which extent two programs behave in a similar, although non equivalent, way.…

Logic in Computer Science · Computer Science 2021-04-28 Paolo Pistone

Many literatures consider the extended Reed-Solomon (RS) codes, including their dual codes and covering radii, but few focus on extended algebraic geometry (AG) codes of genus $g\ge1$. In this paper, we investigate extended AG codes and…

Information Theory · Computer Science 2025-09-29 Yunlong Zhu , Chang-An Zhao

Bombieri and Zannier gave an effective construction of algebraic numbers of small height inside the maximal Galois extension of the rationals which is totally split at a given finite set of prime numbers. They proved, in particular, an…

Number Theory · Mathematics 2021-01-22 Sara Checcoli , Arno Fehm