English
Related papers

Related papers: Asymptotically good 4-quasi transitive algebraic g…

200 papers

An asymptotic on the logarithms of the relative class numbers of the cyclotomic number fields of prime conductors $p$ is known. Here we give an asymptotic on the logarithms of the relative class numbers of the imaginary abelian number…

Number Theory · Mathematics 2025-02-03 Stéphane Louboutin

An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check codes achieving high girth is presented. The construction allows flexibility in the choice of design parameters like rate, average…

Information Theory · Computer Science 2008-02-06 K. Murali Krishnan , Rajdeep Singh , L. Sunil Chandran , Priti Shankar

Over-complete systems of vectors, or in short, frames, play the role of analog codes in many areas of communication and signal processing. To name a few, spreading sequences for code-division multiple access (CDMA), over-complete…

Information Theory · Computer Science 2021-11-16 Marina Haikin , Matan Gavish , Dustin G. Mixon , Ram Zamir

We show that there are good long binary generalized quasi-cyclic self-dual (either Type I or Type II) codes.

Information Theory · Computer Science 2016-01-12 MinJia Shi , Yan Liu , Patrick Solé

We extend classical results on simple varieties of trees (asymptotic enumeration, average behavior of tree parameters) to trees counted by their number of leaves. Motivated by genome comparison of related species, we then apply these…

Combinatorics · Mathematics 2016-10-03 Mathilde Bouvel , Marni Mishna , Cyril Nicaud

Fast encoding and decoding of codes have been always an important topic in code theory as well as complexity theory. Although encoding is easier than decoding in general, designing an encoding algorithm of codes of length $N$ with…

Computational Complexity · Computer Science 2024-07-08 Songsong Li , Shu Liu , Liming Ma , Yunqi Wan , Chaoping Xing

The Zagier $L$-series encode data of real quadratic fields. We study the average size of these $L$-series, and prove asymptotic expansions and omega results for the expansion. We then show how the error term in the asymptotic expansion can…

Number Theory · Mathematics 2019-12-12 Olga Balkanova , Dmitry Frolenkov , Morten S. Risager

We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…

Combinatorics · Mathematics 2024-01-02 Thierry Monteil , Khaydar Nurligareev

Let p be a prime number, and let K be a number field. For p=2, assume moreover K totally imaginary. In this note we prove the existence of asymptotically good extensions L{K of cohomological dimension 2 in which infinitely many primes split…

Number Theory · Mathematics 2020-02-26 Oussama Hamza , Christian Maire

Recently, Okounkov, Lazarsfeld and Mustata, and Kaveh and Khovanskii have shown that the growth of a graded linear series on a projective variety over an algebraically closed field is asymptotic to a polynomial. We give a complete…

Algebraic Geometry · Mathematics 2012-12-27 Steven Dale Cutkosky

Let $A$ and $B$ be $C^*$-algebras with $A$ separable, let $I$ be an ideal in $B$, and let $\psi\colon A\to B/I$ be a completely positive contractive linear map. We show that there is a continuous family $\Theta_t\colon A\to B$, for $t\in…

Operator Algebras · Mathematics 2025-09-16 Marzieh Forough , Eusebio Gardella , Klaus Thomsen

We consider well-quasi-order for classes of permutation graphs which omit both a path and a clique. Our principle result is that the class of permutation graphs omitting $P_5$ and a clique of any size is well-quasi-ordered. This is proved…

Combinatorics · Mathematics 2015-04-28 Aistis Atminas , Robert Brignall , Nicholas Korpelainen , Vadim Lozin , Vincent Vatter

We introduce the notion of asymptotic Grothendieck groups for abelian and triangulated categories that are both AB4 and AB4*. We study when the asymptotic Grothendieck group of the heart of a triangulated category with a t-structure is…

Category Theory · Mathematics 2021-08-20 Gregoire Naisse

We present new constructions of quasi-cyclic (QC) and generalized quasi-cyclic (GQC) codes from algebraic curves. Unlike previous approaches based on elliptic curves, our method applies to curves that are Kummer extensions of the rational…

Information Theory · Computer Science 2026-02-06 Matteo Bonini , Arianna Dionigi , Francesco Ghiandoni

We study the questions of determining the asymptotics of the probabilistic characteristics of additive arithmetic functions in the paper, regardless of whether they have a limit distribution or not. Several assertions are proved about the…

Number Theory · Mathematics 2021-08-31 Victor Volfson

The number A(q) is the upper limit of the ratio of the maximum number of points of a curve defined over $\Fq$ to the genus. By constructing class field towers with good parameters we present improvements of lower bounds of A(q) for q an odd…

Number Theory · Mathematics 2007-05-23 Wen-Ching Li , Hiren Maharaj

Motivated by a concept studied in [1], we consider a property of matrices over finite fields that generalizes triangular totally nonsingular matrices to block matrices. We show that (1) matrices with this property suffice to construct good…

Information Theory · Computer Science 2020-12-08 Pavel Pudlák

We determine the algebraic structure of the multiplicative loops for locally compact $2$-dimensional topological connected quasifields. In particular, our attention turns to multiplicative loops which have either a normal subloop of…

Rings and Algebras · Mathematics 2015-07-07 Giovanni Falcone , Ágota Figula , Karl Strambach

In this article we establish the asymptotic behavior of generating functions related to the exponential sum over finite fields of elementary symmetric functions and their perturbations. This asymptotic behavior allows us to calculate the…

Number Theory · Mathematics 2019-09-02 Luis A. Medina , L. Brehsner Sepúlveda , César A. Serna-Rapello

We present an interleaving scheme that yields quasi-cyclic turbo codes. We prove that randomly chosen members of this family yield with probability almost 1 turbo codes with asymptotically optimum minimum distance, i.e. growing as a…

Information Theory · Computer Science 2007-07-16 Joseph Boutros , Gilles Zémor