Related papers: Block-transitive algebraic geometry codes attainin…
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…
Sum-rank codes have wide applications in multishot network coding, distributed storage and the construction of space-time codes. Asymptotically good sequences of linearized algebraic geometry sum-rank codes, exceeding the…
This is a chapter in a forthcoming book on completely regular codes in distance regular graphs. The chapter provides an overview, and some original results, on codes in distance regular graphs which admit symmetries via a permutation group…
In this note, we study non-transitive graphs and prove a number of results when they satisfy a coarse version of transitivity. Also, for each finitely generated group $G$, we produce continuum many pairwise non-quasi-isometric regular…
A family of quantum codes of increasing block length with positive rate is asymptotically good if the ratio of its distance to its block length approaches a positive constant. The asymptotic quantum Gilbert-Varshamov (GV) bound states that…
Let X be a projective scheme over a finite field. In this paper, we consider the asymptotic behavior of the number of effective cycles on X with bounded degree as it goes to the infinity. By this estimate, we can define a certain kind of…
This paper introduces new constructions of sum-rank metric codes derived from algebraic function fields, as existing results on such codes remain limited. A major challenge lies in the determination of their parameters. We address this…
In this article we study the transitivity of the group of automorphisms of real algebraic surfaces. We characterize real algebraic surfaces with very transitive automorphism groups. We give applications to the classification of real…
In this paper we describe a class of codes called {\it permutation codes}. This class of codes is a generalization of cyclic codes and quasi-cyclic codes. We also give some examples of optimal permutation codes over binary, ternary, and…
In this paper new infinite families of linear binary completely transitive codes are presented. They have covering radius $\rho = 3$ and 4, and are a half part of the binary Hamming and the binary extended Hamming code of length $n=2^m-1$…
We review the nearly complete classification project for finite distance-transitive graphs and compile a list of all known graphs. Interestingly, we find that those graphs with diameter larger than 4, apart from a small finite number of…
With respect to the transversal gate group (an invariant of quantum codes), we demonstrate that non-additive codes can outperform stabilizer codes. We do this by constructing spin codes that correspond to permutation-invariant multiqubit…
The theory of error-correcting codes is concerned with constructing codes that optimize simultaneously transmission rate and relative minimum distance. These conflicting requirements determine an asymptotic bound, which is a continuous…
This paper deals with block-transitive $t$-$(v,k,\lambda)$ designs in affine spaces for large $t$, with a focus on the important index $\lambda=1$ case. We prove that there are no non-trivial 5-$(v,k,1)$ designs admitting a block-transitive…
Constructing quantum codes with good parameters and useful transversal gates is a central problem in quantum error correction. In this paper, we continue our work in arXiv:2502.01864 and construct the first family of asymptotically good…
We study covering codes of permutations with the $\ell_\infty$-metric. We provide a general code construction, which uses smaller building-block codes. We study cyclic transitive groups as building blocks, determining their exact covering…
This paper contains the more significant part of the article with the same title that will appear in the Volume 12 of Journal of Group Theory (2009). In this paper we determine all algebraic transformation groups $G$, defined over an…
This paper investigates block-transitive automorphism groups of t-(k^2,k,\lambda) designs. Let D be a non-trivial t-(k^2,k,\lambda) design, G \leq \Aut(D) be block-transitive with X\unlhd G\leq \Aut(X), where X = PSL(2,q)(q\geq4). Then q =…
We prove the existence of an upper bound on the asymptotic dimension of tree amalgamations of locally finite quasi-transitive connected graphs. This generalises a result of Dranishnikov for free products with amalgamation and a result of…
We study the behavior of blocks in flat families of finite-dimensional algebras. In a general setting we construct a finite directed graph encoding a stratification of the base scheme according to the block structures of the fibers. This…