Related papers: Small Strong Blocking Sets by Concatenation
A supersaturated design is a design whose run size is not large enough for estimating all the main effects. The goodness of multi-level supersaturated designs can be judged by the generalized minimum aberration criterion proposed by Xu and…
Many graph problems were first shown to be fixed-parameter tractable using the results of Robertson and Seymour on graph minors. We show that the combination of finite, computable, obstruction sets and efficient order tests is not just one…
We investigate weakly constrained codes, in which specific patterns occur with prescribed frequencies rather than being strictly forbidden as in conventional constrained coding. We propose a capacity-achieving construction of a weakly…
Spatially-coupled low-density parity-check codes attract much attention due to their capacity-achieving performance and a memory-efficient sliding-window decoding algorithm. On the other hand, the encoder needs to solve large linear…
Batch codes are of potential use for load balancing and private information retrieval in distributed data storage systems. Recently, a special case of batch codes, termed functional batch codes, was proposed in the literature. In functional…
This paper considers the construction of minimum aberration (MA) blocked factorial designs. Based on coding theory, the concept of minimum moment aberration due to Xu [Statist. Sinica 13 (2003) 691--708] for unblocked designs is extended to…
Minimal codes are being intensively studied in last years. $[n,k]_{q}$-minimal linear codes are in bijection with strong blocking sets of size $n$ in $PG(k-1,q)$ and a lower bound for the size of strong blocking sets is given by…
We investigate the relationship between the dynamical properties of minimal topological dynamical systems and the multiplicative combinatorial properties of return time sets arising from those systems. In particular, we prove that for a…
The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in (Jitman, Ling, (2015)), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling, Sol\'e, (2001)). We give a…
This paper mainly focuses on cones whose basis is a maximum $h$-scattered linear set. We start by investigating the intersection sizes of such cones with the hyperplanes. Then we analyze two constructions of point sets with few intersection…
Stochastic block models (SBMs) are often used to find assortative community structures in networks, such that the probability of connections within communities is higher than in between communities. However, classic SBMs are not limited to…
Block designs are combinatorial structures in which each pair of a set of varieties appears together in a fixed number of blocks. Complete graphs are graphs in which every pair of vertices are adjacent. We present some new constructions of…
Strong difference families of special types are introduced to produce new relative difference families from the point of view of both asymptotic existences and concrete examples. As applications, group divisible designs of type $30^u$ with…
We introduce the concept of generalized concatenated quantum codes. This generalized concatenation method provides a systematical way for constructing good quantum codes, both stabilizer codes and nonadditive codes. Using this method, we…
We explicitly construct an infinite family of asymptotically good concatenated quantum stabilizer codes where the outer code uses CSS-type quantum Reed-Solomon code and the inner code uses a set of special quantum codes. In the field of…
This paper investigates the problem of single-source multicasting over a communication network in the presence of restricted adversaries. When the adversary is constrained to operate only on a prescribed subset of edges, classical cut-set…
How small can a set be while containing many configurations? Following up on earlier work of Erd\H os and Kakutani \cite{MR0089886}, M\'ath\'e \cite{MR2822418} and Molter and Yavicoli \cite{Molter}, we address the question in two…
Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…
The subblock energy-constrained codes (SECCs) and sliding window-constrained codes (SWCCs) have recently attracted attention due to various applications in communcation systems such as simultaneous energy and information transfer. In a…
We study the amount of reliable information that can be stored in a DNA-based storage system with noisy sequencing, where each codeword is composed of short DNA molecules. We analyze a concatenated coding scheme, where the outer code is…