English
Related papers

Related papers: A criterion for determining whether multiple shell…

200 papers

With the increasing prevalence of chiplet systems in high-performance computing applications, the number of design options has increased dramatically. Instead of chips defaulting to a single die design, now there are options for 2.5D and 3D…

Hardware Architecture · Computer Science 2025-03-21 Alexander Graening , Jonti Talukdar , Saptadeep Pal , Krishnendu Chakrabarty , Puneet Gupta

Let $C$ be a four-weight binary code, which has all one vector. Furthermore, we assume that $C$ supports $t$-designs for all weights obtained from the Assmus--Mattson theorem. We previously showed that $t\leq 5$. In the present paper, we…

Combinatorics · Mathematics 2023-03-15 Eiichi Bannai , Tsuyoshi Miezaki , Hiroyuki Nakasora

A $q$-ary $t$-$(n,w,\lambda)$ design is a collection $\mathcal{A}$ of vectors of weight $w$ in $\mathbb{F}_{q}^{n}$ with the property that every vector of weight $t$ in $\mathbb{F}_{q}^{n}$ is contained in exactly $\lambda$ members of…

Information Theory · Computer Science 2026-03-16 Xinghao Wu , Junling Zhou

Linear codes and $t$-designs are interactive with each other. It is well known that some $t$-designs have been constructed by using certain linear codes in recent years. However, only a small number of infinite families of the extended…

Information Theory · Computer Science 2022-11-28 Can Xiang , Chunming Tang

Tight $2 s$-designs are the $2 s$-$(v, k, \lambda)$ designs whose sizes achieve the Fisher type lower bound ${v \choose s}$. Symmetric $2$-designs, the Witt $4$-$(23, 7, 1)$ design and the Witt $4$-$(23, 16, 52)$ design are tight designs.…

Combinatorics · Mathematics 2023-12-25 Ziqing Xiang

This paper extends the design-based framework to settings with multi-way cluster dependence, and shows how multi-way clustering can be justified when clustered assignment and clustered sampling occurs on different dimensions, or when either…

Econometrics · Economics 2023-09-06 Luther Yap

A relative t-design in the binary Hamming association schemes H(n,2) is equivalent to a weighted regular t-wise balanced design, i.e., certain combinatorial t-design which allow different sizes of blocks and a weight function on blocks. In…

Combinatorics · Mathematics 2015-12-08 Eiichi Bannai , Etsuko Bannai , Yan Zhu

An effective two-body interaction is constructed from a new Reid-like $NN$ potential for a large no-core space consisting of six major shells and is used to generate the shell-model properties for light nuclei from $A$=2 to 6. (For…

Nuclear Theory · Physics 2008-11-26 D. C. Zheng , J. P. Vary , B. R. Barrett

The performance of a Turbo code with short block length depends critically on the interleaver design. There are two major criteria in the design of an interleaver: the distance spectrum of the code and the correlation between the…

Combinatorics · Mathematics 2007-07-16 H. R. Sadjadpour , N. J. A. Sloane , M. Salehi , G. Nebe

This paper addresses the resilience of large-scale closed-loop structured systems in the sense of arbitrary pole placement when subject to failure of feedback links. Given a structured system with input, output, and feedback matrices, we…

Optimization and Control · Mathematics 2019-04-01 RaviTeja Gundeti , Shana Moothedath , Prasanna Chaporkar

We clarify the mathematical structure underlying unitary $t$-designs. These are sets of unitary matrices, evenly distributed in the sense that the average of any $t$-th order polynomial over the design equals the average over the entire…

Quantum Physics · Physics 2009-11-13 D. Gross , K. Audenaert , J. Eisert

A recent work by Lesnick and Wright proposed a visualisation of $2$D persistence modules by using their restrictions onto lines, giving a family of $1$D persistence modules. We give a constructive proof that any $1$D persistence module with…

Representation Theory · Mathematics 2020-03-25 Mickaël Buchet , Emerson G. Escolar

In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…

Information Theory · Computer Science 2014-10-15 Hugues Randriambololona

We consider designs for cancer trials which allow each medical centre to treat only a limited number of cancer types with only a limited number of drugs. We specify desirable properties of these designs, and prove some consequences. Then we…

Applications · Statistics 2019-05-31 R. A. Bailey , Peter J. Cameron

Prediction capability is considered an important issue in response surface methodology. Following the line of argument that a design should have several desirable properties we have extended an existing compound design criterion to include…

We introduce and give examples of applications of an optimality criterion which can be used for the design and comparison of multiple beam profile emittance and Twiss parameters measurement sections and which is independent from the…

Accelerator Physics · Physics 2013-05-08 V. Balandin , W. Decking , N. Golubeva

Multivalent particles have the ability to form multiple bonds to a substrate. Hence, a multivalent interaction can be strong, even if the individual bonds are weak. However, much more interestingly, multivalency greatly increases the…

Soft Condensed Matter · Physics 2017-04-04 Tine Curk , Jure Dobnikar , Daan Frenkel

Algorithms for machine learning-guided design, or design algorithms, use machine learning-based predictions to propose novel objects with desired property values. Given a new design task -- for example, to design novel proteins with high…

Machine Learning · Computer Science 2025-07-04 Clara Fannjiang , Ji Won Park

A \textbf{single change covering design} is a $v$-set $X$ and an ordered list $\cL$ of $b$ blocks of size $k$ where every $t$-set must occur in at least one block. Each pair of consecutive blocks differs by exactly one element. A single…

Combinatorics · Mathematics 2024-11-12 Amanda Chafee , Brett Stevens

This work presents a recursive construction for simple $t$-designs using resolutions of the ingredient designs. The result extends a construction of $t$-designs in our recent paper [39]. Essentially, the method in [39] describes the blocks…

Combinatorics · Mathematics 2016-12-07 Tran van Trung