English
Related papers

Related papers: Generalized Hermitian Codes over GF(2^r)

200 papers

Lenstra and Guruswami described number field analogues of the algebraic geometry codes of Goppa. Recently, the first author and Oggier generalised these constructions to other arithmetic groups: unit groups in number fields and orders in…

Number Theory · Mathematics 2020-09-01 Christian Maire , Aurel Page

Fractal geometry and analysis constitute a growing field, with numerous applications, based on the principles of fractional calculus. Fractals sets are highly effective in improving convex inequalities and their generalisations. In this…

Functional Analysis · Mathematics 2024-01-02 Peter Olamide Olanipekun

In this paper we reopen the discussion of gauging the two-dimensional off-shell (2,2) supersymmetric sigma models written in terms of semichiral superfields. The associated target space geometry of this particular sigma model is generalized…

High Energy Physics - Theory · Physics 2008-11-26 Willie Merrell , Diana Vaman

We here revisit Fourier analysis on the Heisenberg group H^d. Whereas, according to the standard definition, the Fourier transform of an integrable function f on H^d is a one parameter family of bounded operators on L 2 (R^d), we define (by…

Classical Analysis and ODEs · Mathematics 2016-09-14 Hajer Bahouri , Jean-Yves Chemin , Raphael Danchin

Generalized Goppa codes are defined by a code locator set $\mathcal{L}$ of polynomials and a Goppa polynomial $G(x)$. When the degree of all code locator polynomials in $\mathcal{L}$ is one, generalized Goppa codes are classical Goppa…

Information Theory · Computer Science 2021-06-22 Hedongliang Liu , Sabine Pircher , Alexander Zeh , Antonia Wachter-Zeh

We characterize the elements of generalized Gelfand Shilov spaces in terms of the coefficients of their Fourier-Hermite expansion. The technique we use can be applied both in quasianalytic and nonquasianalytic case. The characterizations…

Quantum Physics · Physics 2007-06-18 Z. Lozanov--Crvenkovic , D. Perisic

In this work, our main objective is to construct quantum codes from quasi-twisted (QT) codes. At first, a necessary and sufficient condition for Hermitian self-orthogonality of QT codes is introduced by virtue of the Chinese Remainder…

Information Theory · Computer Science 2020-01-07 Jingjie Lv , Ruihu Li , Junli Wang

We prove an analogue of Gutzmer's formula for Hermite expansions. As a consequence we obtain a new proof of a characterisation of the image of $ L^2(\R^n) $ under the Hermite semigroup. We also obtain some new orthogonality relations for…

Classical Analysis and ODEs · Mathematics 2007-05-23 S. Thangavelu

Let $\mathbb{F}_q$ be a finite field with $q=p^{e}$ elements, where $p$ is a prime number and $e \geq 1$ is an integer. In this paper, by means of generalized Reed-Solomon (GRS) codes, we construct two new classes of quantum…

Information Theory · Computer Science 2020-02-17 Hualu Liu , Xiusheng Liu

The present paper is the companion of [1] in which we proposed a scheme that tries to derive the Quantum Field Theory (QFT) on Curved Spacetimes (CST) limit from background independent Quantum General Relativity (QGR). The constructions of…

General Relativity and Quantum Cosmology · Physics 2014-11-17 Hanno Sahlmann , Thomas Thiemann

Hoholdt, van Lint and Pellikaan used order functions to construct codes by means of Linear Algebra and Semigroup Theory only. However, Geometric Goppa codes that can be represented by this method are mainly those based on just one point. In…

Information Theory · Computer Science 2007-07-13 C. Carvalho , C. Munuera , E. Silva , F. Torres

In this paper, we will employ the technique used in the proof of classical Singleton bound to derive upper bounds for rank metric codes and Ferrers diagram rank metric codes. These upper bounds yield the rank distance Singleton bound and an…

Information Theory · Computer Science 2015-06-19 Srikanth B. Pai , B. Sundar Rajan

Codes which have a finite field $\mathbb{F}_{q^m}$ as their alphabet but which are only linear over a subfield $\mathbb{F}_q$ are a topic of much recent interest due to their utility in constructing quantum error correcting codes. In this…

Information Theory · Computer Science 2026-04-30 Daniel Bossaller , Daniel Herden , Indalecio Ruiz-Bolaños

In this paper, we first consider the iterated skew polynomial ring $\mathscr{R}[z_1;\tau_1,\delta_{\tau_1}]$\\$[z_2;\tau_2,\delta_{\tau_2}]$, where $\mathscr{R}$ is a finite ring with unity. Then we use this structure for the construction…

Information Theory · Computer Science 2025-01-07 Shikha Patel , Om Prakash

Recently, subfield codes of geometric codes over large finite fields $\gf(q)$ with dimension $3$ and $4$ were studied and distance-optimal subfield codes over $\gf(p)$ were obtained, where $q=p^m$. The key idea for obtaining very good…

Information Theory · Computer Science 2020-08-11 Ziling Heng , Cunsheng Ding

The second Feng-Rao number of every inductive numerical semigroup is explicitly computed. This number determines the asymptotical behaviour of the order bound for the second Hamming weight of one-point AG codes. In particular, this result…

Information Theory · Computer Science 2015-05-07 J. I. Farrán , P. A. García-Sánchez

It is known that the Hermitian varieties are codewords in the code defined by the points and hyperplanes of the projective spaces $PG(r,q^2)$. In finite geometry, also quasi-Hermitian varieties are defined. These are sets of points of…

Combinatorics · Mathematics 2017-06-22 A. Aguglia , D. Bartoli , L. Storme , Zs. Weiner

Miculescu and Mihail in 2008 introduced a concept of a generalized iterated function system (GIFS in short), a particular extension of classical IFS. Instead of families of selfmaps of a metric space $X$, they considered families of…

Dynamical Systems · Mathematics 2017-07-19 Łukasz Maślanka , Filip Strobin

We prove that if $n >k^2$ then a $k$-dimensional linear code of length $n$ over ${\mathbb F}_{q^2}$ has a truncation which is linearly equivalent to a Hermitian self-orthogonal linear code. In the contrary case we prove that truncations of…

Information Theory · Computer Science 2021-08-19 Simeon Ball , Ricard Vilar

This article introduces Generalized Hyperderivative Reed-Solomon codes (GHRS codes), which generalize NRT Reed-Solomon codes. Its main results are as follows: 1) every GHRS code is MDS, 2) the dual of a GHRS code is also an GHRS code, 3)…

Information Theory · Computer Science 2025-12-30 Mahir Bilen Can , Benjamin Horowitz