Coding theory and combinatorial $t$-designs have close connections and interesting interplay. One of the major approaches to the construction of combinatorial t-designs is the employment of error-correcting codes. As we all known, some $t$-designs have been constructed with this approach by using certain linear codes in recent years. However, only a few infinite families of cyclic codes holding an infinite family of $3$-designs are reported in the literature. The objective of this paper is to study an infinite family of cyclic codes and determine their parameters. By the parameters of these codes and their dual, some infinite family of $3$-designs are presented and their parameters are also explicitly determined. In particular, the complements of the supports of the minimum weight codewords in the studied cyclic code form a Steiner system. Furthermore, we show that the infinite family of cyclic codes admit $3$-transitive automorphism groups.
相關內容
Modern quantum programming languages integrate quantum resources and classical control. They must, on the one hand, be linearly typed to reflect the no-cloning property of quantum resources. On the other hand, high-level and practical languages should also support quantum circuits as first-class citizens, as well as families of circuits that are indexed by some classical parameters. Quantum programming languages thus need linear dependent type theory. This paper defines a general semantic structure for such a type theory via certain fibrations of monoidal categories. The categorical model of the quantum circuit description language Proto-Quipper-M by Rios and Selinger (2017) constitutes an example of such a fibration, which means that the language can readily be integrated with dependent types. We then devise both a general linear dependent type system and a dependently typed extension of Proto-Quipper-M, and provide them with operational semantics as well as a prototype implementation.
Let $G$ be an $n$-vertex graph, and $s,t$ vertices of $G$. We present an efficient algorithm which enumerates the set of minimal $st$-separators of $G$ in ascending order of cardinality, with a delay of $O(n^{3.5})$ per separator. In particular, we present an algorithm that lists, in ascending order of cardinality, all minimal separators with at most $k$ vertices. In that case, we show that the delay of the enumeration algorithm is $O(kn^{2.5})$ per separator. Our process is based on a new method that can decide, in polynomial time, whether the set of minimal separators under certain inclusion, exclusion, and cardinality constraints is empty.
In the Group Testing problem, the objective is to learn a subset K of some much larger domain N, using the shortest-possible sequence of queries Q. A feedback to a query provides some information about the intersection between the query and subset K. Several specific feedbacks have been studied in the literature, often proving different formulas for the estimate of the query complexity of the problem, defined as the shortest length of queries' sequence solving Group Testing problem with specific feedback. In this paper we study what are the properties of the feedback that influence the query complexity of Group Testing and what is their measurable impact. We propose a generic framework that covers a vast majority of relevant settings considered in the literature, which depends on two fundamental parameters of the feedback: input capacity $\alpha$ and output expressiveness $\beta$. They upper bound the logarithm of the size of the feedback function domain and image, respectively. To justify the value of the framework, we prove upper bounds on query complexity of non adaptive, deterministic Group Testing under some "efficient" feedbacks, for minimum, maximum and general expressiveness, and complement them with a lower bound on all feedbacks with given parameters $\alpha,\beta$. Our upper bounds also hold if the feedback function could get an input twisted by a malicious adversary, in case the intersection of a query and the hidden set is bigger than the feedback capacity $\alpha$. We also show that slight change in the feedback function may result in substantial worsening of the query complexity. Additionally, we analyze explicitly constructed randomized counterparts of the deterministic results. Our results provide some insights to what are the most useful bits of information an output-restricted feedback could provide, and open a number of challenging research directions.
For the implementations of controllers on digital processors, certain limitations, e.g. in the instruction set and register length, need to be taken into account, especially for safety-critical applications. This work aims to provide a computer-certified inductive definition for the control functions that are implemented on such processors accompanied with the fixed-point data type in a proof assistant. Using these inductive definitions we formally ensure correct realization of the controllers on a digital processor. Our results guarantee overflow-free computations of the implemented control algorithm. The method presented in this paper currently supports functions that are defined as polynomials within an arbitrary fixed-point structure. We demonstrate the verification process in the case study on an example with different scenarios of fixed-point type implementations.
Three algorithm are proposed to evaluate volume potentials that arise in boundary element methods for elliptic PDEs. The approach is to apply a modified fast multipole method for a boundary concentrated volume mesh. If $h$ is the meshwidth of the boundary, then the volume is discretized using nearly $O(h^{-2})$ degrees of freedom, and the algorithm computes potentials in nearly $O(h^{-2})$ complexity. Here nearly means that logarithmic terms of $h$ may appear. Thus the complexity of volume potentials calculations is of the same asymptotic order as boundary potentials. For sources and potentials with sufficient regularity the parameters of the algorithm can be designed such that the error of the approximated potential converges at any specified rate $O(h^p)$. The accuracy and effectiveness of the proposed algorithms are demonstrated for potentials of the Poisson equation in three dimensions.
Let $\{G_i :i\in\N\}$ be a family of finite Abelian groups. We say that a subgroup $G\leq \prod\limits_{i\in \N}G_i$ is \emph{order controllable} if for every $i\in \mathbb{N}$ there is $n_i\in \mathbb{N}$ such that for each $c\in G$, there exists $c_1\in G$ satisfying that $c_{1|[1,i]}=c_{|[1,i]}$, $supp (c_1)\subseteq [1,n_i]$, and order$(c_1)$ divides order$(c_{|[1,n_i]})$. In this paper we investigate the structure of order controllable subgroups. It is proved that every order controllable, profinite, abelian group contains a subset $\{g_n : n\in\N\}$ that topologically generates the group and whose elements $g_n$ all have finite support. As a consequence, sufficient conditions are obtained that allow us to encode, by means of a topological group isomorphism, order controllable profinite abelian groups. Some applications of these results to group codes will appear subsequently \cite{FH:2021}.
Let $\{G_i :i\in\N\}$ be a family of finite Abelian groups. We say that a subgroup $G\leq \prod\limits_{i\in \N}G_i$ is \emph{order controllable} if for every $i\in \mathbb{N}$ there is $n_i\in \mathbb{N}$ such that for each $c\in G$, there exists $c_1\in G$ satisfying that $c_{1|[1,i]}=c_{|[1,i]}$, $supp (c_1)\subseteq [1,n_i]$, and order$(c_1)$ divides order$(c_{|[1,n_i]})$. In this paper we investigate the structure of order controllable group codes. It is proved that if $G$ is an order controllable, shift invariant, group code over a finite abelian group $H$, then $G$ possesses a finite canonical generating set. Furthermore, our construction also yields that $G$ is algebraically conjugate to a full group shift.
In network coding, a flag code is a collection of flags, that is, sequences of nested subspaces of a vector space over a finite field. Due to its definition as the sum of the corresponding subspace distances, the flag distance parameter encloses a hidden combinatorial structure. To bring it to light, in this paper, we interpret flag distances by means of distance paths drawn in a convenient distance support. The shape of such a support allows us to create an ad hoc associated Ferrers diagram frame where we develop a combinatorial approach to flag codes by relating the possible realizations of their minimum distance to different partitions of appropriate integers. This novel viewpoint permits to establish noteworthy connections between the flag code parameters and the ones of its projected codes in terms of well known concepts coming from the classical partitions theory.
A full performance analysis of the widely linear (WL) minimum variance distortionless response (MVDR) beamformer is introduced. While the WL MVDR is known to outperform its strictly linear counterpart, the Capon beamformer, for noncircular complex signals, the existing approaches provide limited physical insights, since they explicitly or implicitly omit the complementary second-order (SO) statistics of the output interferences and noise (IN). To this end, we exploit the full SO statistics of the output IN to introduce a full SO performance analysis framework for the WL MVDR beamformer. This makes it possible to separate the overall signal-to-interference plus noise ratio (SINR) gain of the WL MVDR beamformer w.r.t. the Capon one into the individual contributions along the in-phase (I) and quadrature (Q) channels. Next, by considering the reception of the unknown signal of interest (SOI) corrupted by an arbitrary number of orthogonal noncircular interferences, we further unveil the distribution of SINR gains in both the I and Q channels, and show that in almost all the spatial cases, these performance advantages are more pronounced when the SO noncircularity rate of the interferences increases. Illustrative numerical simulations are provided to support the theoretical results.
Although the widely linear least mean square error (WLMMSE) receiver has been an appealing option for multiple-input-multiple-output (MIMO) wireless systems, a statistical understanding on its pose-detection signal-to-interference-plus-noise ratio (SINR) in detail is still missing. To this end, we consider a WLMMSE MIMO transmission system with rectilinear or quasi-rectilinear (QR) signals over the uncorrelated Rayleigh fading channel and investigate the statistical properties of its SINR for an arbitrary antenna configuration with $N_t$ transmit antennas and $N_r$ receive ones. We first derive an analytic probability density function (PDF) of the SINR in terms of the confluent hypergeometric function of the second kind, for WLMMSE MIMO systems with an arbitrary $N_r$ and $N_t=2, 3$. For a more general case in practice, i.e., $N_t>3$, we resort to the moment generating function to obtain an approximate but closed form PDF under some mild conditions, which, as expected, is more Gaussian-like as $2N_r-N_t$ increases. The so-derived PDFs are able to provide key insights into the WLMMSE MIMO receiver in terms of the outage probability, the symbol error rate, and the diversity gain, all presented in closed form. In particular, its diversity gain and the gain improvement over the conventional LMMSE one are explicitly quantified as $N_r-(N_t-1)/2$ and $(N_t-1)/2$, respectively. Finally, Monte Carlo simulations support the analysis.
注冊地址： 北京市海淀區羊坊店路18號2幢3層301-191